A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract)

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Vincent Berry Département d'Informatique Fondamentale et Applications, LIRMM, Université de Montpellier II, France and Département de Mathématiques, EURISE, Université de Saint-Etienne, ...
David Bryant
Tao Jiang
Paul Kearney
Ming Li
Todd Wareham Department of Computer Science, Memorial University of Newfoundland, St. John's, NF A1B 3X5, Canada and McMaster University
Haoyong Zhang Department of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract) 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 20
· Downloads (cumulative): 324
· Citation Count: 15

Published in:
· Proceeding
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Pages 287-296
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2000
table of contents ISBN:0-89871-453-2

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder