Author of the publication

Computing Phylogenetic Roots with Bounded Degrees and Errors.

, , and . WADS, volume 2125 of Lecture Notes in Computer Science, page 377-388. Springer, (2001)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Reducing Randomness via Irrational Numbers., and . SIAM J. Comput., 29 (4): 1247-1256 (2000)The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations., , , and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 444-455. Springer, (2001)Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement., and . AAIM, volume 5034 of Lecture Notes in Computer Science, page 84-96. Springer, (2008)Computing Phylogenetic Roots with Bounded Degrees and Errors., , and . WADS, volume 2125 of Lecture Notes in Computer Science, page 377-388. Springer, (2001)Fast RNC and NC Algorithms for Maximal Path Sets., , and . Theor. Comput. Sci., 215 (1-2): 89-98 (1999)Identifying duplications and lateral gene transfers simultaneously and rapidly., , and . J. Bioinform. Comput. Biol., 20 (1): 2150033:1-2150033:26 (2022)Finding a Center Tree of Phylogenetic Trees via Leaf Removal., , , and . BIBM, page 61-64. IEEE Computer Society, (2018)The Complexity of Selecting Maximal Solutions., and . SCT, page 313-325. IEEE Computer Society, (1993)A Randomized Approximation Algorithm for Metric Triangle Packing., , , , and . COCOA, volume 11949 of Lecture Notes in Computer Science, page 119-129. Springer, (2019)Approximation Algorithms for Maximally Balanced Connected Graph Partition., , , , and . COCOA, volume 11949 of Lecture Notes in Computer Science, page 130-141. Springer, (2019)