A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Sampath Kannan Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA
Tandy Warnow Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA
Published in:
· Proceeding
SODA '95 Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Pages 595-603
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1995
table of contents ISBN:0-89871-349-8
A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 7
· Downloads (cumulative): 195
· Citation Count: 8


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