( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Longest Common Exemplar Subsequence Problem.

, , , , , , и . BIBM, стр. 92-95. IEEE Computer Society, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Feng Bao

Zhaoyong Feng

Feng Li

Feng He

Jianjun Feng

 

Другие публикации лиц с тем же именем

(g, f)-Factorizations Orthogonal to k Subgraphs.. WG, том 2204 из Lecture Notes in Computer Science, стр. 129-139. Springer, (2001)IsoTree: De Novo Transcriptome Assembly from RNA-Seq Reads - (Extended Abstract)., , , , и . ISBRA, том 10330 из Lecture Notes in Computer Science, стр. 71-83. Springer, (2017)Longest k-tuple Common Sub-Strings., , , , и . BIBM, стр. 63-66. IEEE, (2022)Prediction of Protein Subcellular Locations by Combining K-Local Hyperplane Distance Nearest Neighbor., , и . ADMA, том 4632 из Lecture Notes in Computer Science, стр. 345-351. Springer, (2007)A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling., , , и . ISAAC, том 2223 из Lecture Notes in Computer Science, стр. 26-35. Springer, (2001)Estimating isoform abundance by Particle Swarm Optimization., и . BIBM, стр. 161-166. IEEE Computer Society, (2016)A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs., , , и . FAW, том 9711 из Lecture Notes in Computer Science, стр. 92-101. Springer, (2016)DLmeta: a deep learning method for metagenomic identification., , , и . BIBM, стр. 303-308. IEEE, (2022)A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling., , , и . Int. J. Found. Comput. Sci., 13 (6): 817-827 (2002)A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling., , , , и . IPCO, том 2337 из Lecture Notes in Computer Science, стр. 304-314. Springer, (2002)