General techniques for comparing unrooted evolutionary trees

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 54-65

  Kao, Ming Yang ^a   Lam, Tak Wah ^a   Przytycka, Teresa M ^a   Sung, Wing Kin ^a   Ting, Hing Fung ^a  

^a DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING;

FOUR WAY DYNAMIC PROGRAMMING; LABEL COMPRESSION; ROOTED UNBOUNDED DEGREE CASES; UNROOTED EVOLUTIONARY TREES;

TREES (MATHEMATICS);

EID: 0030642910     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258533.258550     Document Type: Conference Paper

References (25)