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

Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations., and . COCOON, volume 1627 of Lecture Notes in Computer Science, page 71-80. Springer, (1999)Phylogenetic k-Root and Steiner k-Root., , and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 539-551. Springer, (2000)A linear time algorithm for computing hexagonal Steiner minimum trees for terminals on the boundary of a regular hexagon., and . ISCAS, page 196-199. IEEE, (2000)Protein Threading by Linear Programming., , , , and . Pacific Symposium on Biocomputing, page 264-275. (2003)Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane., and . ISCAS (6), page 117-120. IEEE, (1999)Methods for reconstructing the history of tandem repeats and their application to the human genome., , , and . J. Comput. Syst. Sci., 65 (3): 494-507 (2002)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)Computing Phylogenetic Roots with Bounded Degrees and Errors., , and . WADS, volume 2125 of Lecture Notes in Computer Science, page 377-388. Springer, (2001)Approximating Hexagonal Steiner Minimal Trees by Fast Optimal Layout of Minimum Spanning Trees., , and . ICCD, page 392-. IEEE Computer Society, (1999)On the terminal Steiner tree problem., and . Inf. Process. Lett., 84 (2): 103-107 (2002)