( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A More Practical Algorithm for the Rooted Triplet Distance.

, и . AlCoB, том 9199 из Lecture Notes in Computer Science, стр. 109-125. Springer, (2015)

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.

Ramesh Ummanni

Ramesh Sheth

Ramesh Boggula

Ramesh Sharma

Ramesh Samanta

 

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

Determining the Consistency of Resolved Triplets and Fan Triplets., , , и . RECOMB, том 10229 из Lecture Notes in Computer Science, стр. 82-98. (2017)Computing Asymmetric Median Tree of Two Trees via Better Bipartite Matching Algorithm., и . IWOCA, том 10765 из Lecture Notes in Computer Science, стр. 356-367. Springer, (2017)Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree., , , и . IEEE ACM Trans. Comput. Biol. Bioinform., 15 (1): 15-26 (2018)SurVIndel: improving CNV calling from high-throughput sequencing data through statistical testing., и . Bioinform., 37 (11): 1497-1505 (2021)An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees., , и . AlCoB, том 10252 из Lecture Notes in Computer Science, стр. 115-126. Springer, (2017)A More Practical Algorithm for the Rooted Triplet Distance., и . J. Comput. Biol., 24 (2): 106-126 (2017)A More Practical Algorithm for the Rooted Triplet Distance., и . AlCoB, том 9199 из Lecture Notes in Computer Science, стр. 109-125. Springer, (2015)Computing the Rooted Triplet Distance Between Phylogenetic Networks., , , и . IWOCA, том 11638 из Lecture Notes in Computer Science, стр. 290-303. Springer, (2019)