From post

A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates.

, , , , и . WABI, том 9838 из Lecture Notes in Computer Science, стр. 293-306. Springer, (2016)

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.

 

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

The Solution Space of Sorting by Reversals., , , и . ISBRA, том 4463 из Lecture Notes in Computer Science, стр. 293-304. Springer, (2007)DCJ-indel Distance with Distinct Operation Costs., , , и . WABI, том 7534 из Lecture Notes in Computer Science, стр. 378-390. Springer, (2012)A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates., , , , и . WABI, том 9838 из Lecture Notes in Computer Science, стр. 293-306. Springer, (2016)A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance., , , и . WABI, том 242 из LIPIcs, стр. 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Natural Family-Free Genomic Distance., , и . WABI, том 172 из LIPIcs, стр. 3:1-3:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Analysis and Implementation of Sorting by Transpositions Using Permutation Trees., , , , и . BSB, том 6832 из Lecture Notes in Computer Science, стр. 42-49. Springer, (2011)On the inversion-indel distance., , , и . BMC Bioinform., 14 (S-15): S3 (2013)An Overview of Genomic Distances Modeled with Indels.. CiE, том 7921 из Lecture Notes in Computer Science, стр. 22-31. Springer, (2013)Double Cut and Join with Insertions and Deletions., , и . J. Comput. Biol., 18 (9): 1167-1184 (2011)On the Family-Free DCJ Distance., , , и . WABI, том 8701 из Lecture Notes in Computer Science, стр. 174-186. Springer, (2014)