SIGN IN
SIGN UP
General techniques for comparing unrooted evolutionary trees
Full Text:
PDF
Buy this Article
Authors:
Ming-Yang Kao
Department of Computer Science, Duke University, Durham, NC
Tak-Wah Lam
Department of Computer Science, University of Hong Kong, Hong Kong
Teresa M. Przytycka
Department of Biophysics, School of Medicine, Johns Hopkins University, Baltimore, MD
Wing-Kin Sung
Department of Computer Science, University of Hong Kong, Hong Kong
Hing-Fung Ting
Department of Computer Science, University of Hong Kong, Hong Kong
1997 Article
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 17
· Downloads (cumulative): 292
· Citation Count: 3
Published in:
· Proceeding
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Pages 54-65
ACM
New York, NY
, USA
©1997
table of contents
ISBN:0-89791-888-6
doi>
10.1145/258533.258550
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithm design and analysis
algorithms
design
dynamic programming
performance
theory
trees
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder