Skip to main content
SpringerLink
Log in

Of chicken teeth and mouse eyes, or generalized character compatibility

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 937))

Included in the following conference series:

Abstract

We propose a new model of computation for deriving phylogenetic trees based upon a generalization of qualitative characters. The model we propose is based upon recent experimental research in molecular biology. We show that the general case of determining perfect compatibility of generalized ordered characters is an NP-Complete problem, but can be solved in polynomial time for a special case.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agarwala, and D. Fernández-Baca, (1994), Fast and simple algorithms for perfect phytogeny and triangulating colored graphs, DIMACS Tech Report # 94-51.

    Google Scholar 

  2. Agarwala, R. and D. Fernandez-Baca (1994), A Polynomial-time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed. SIAM J. on Computing, Vol. 23 No. 6, pp. 1216–1224.

    Article  Google Scholar 

  3. Alberts, B., Bray, D., Lewis, J., Raff, M., Roberts, K. and Watson, J.D. (1989) The Molecular Biology of the Cell, 2nd Ed., Garland Publishing Inc., New York, pp. 485–488.

    Google Scholar 

  4. H. Bodlaender, M. Fellows, and T. Warnow (1992), Two strikes against perfect phylogeny, Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, Springer Verlag, Lecture Notes in Computer Science, pp. 273–283.

    Google Scholar 

  5. J. Felsenstein (1982), Numerical methods for inferring evolutionary trees, The Quarterly Review of Biology, Vol. 57, No. 4.

    Google Scholar 

  6. Janis, C. (1994) The Sabertooth's Repeat Performances Nat'l. Hist., 103 pp. 78–82.

    Google Scholar 

  7. S. Kannan and T. Warnow (1994), Inferring evolutionary history from DNA sequences, SIAM J. on Computing, Vol. 23, Nov. 4, pp. 713–737.

    Article  Google Scholar 

  8. S. Kannan and T. Warnow, A fast algorithm for the computation and enumeration of perfect phylogenies, Proceedings, ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1995, pp. 595–603.

    Google Scholar 

  9. Kollar, E.J. and Fisher, C. (1980) Tooth Induction in Chick Epithelium: Expression of Quiescent Genes for Enamel Synthesis Science 207, pp. 993–995.

    PubMed  Google Scholar 

  10. F.R. McMorris, T. Warnow, and T. Wimer (1994), Triangulating vertex colored graphs, SIAM J. Discrete Mathematics, Vol. 7 No. 2, pp. 296–306.

    Article  Google Scholar 

  11. Michael Steel (1992), The Complexity of Reconstructing Trees from Qualitative Characters and Subtrees, Journal of Classification, Vol. 9, pp. 91–116.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Biomathematics, Mt. Sinai School of Medicine, USA

    Craig Benham

  2. Department of Computer and Information Sciences, University of Pennsylvania, USA

    Sampath Kannan & Tandy Warnow

Authors
  1. Craig Benham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sampath Kannan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tandy Warnow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zvi Galil Esko Ukkonen

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benham, C., Kannan, S., Warnow, T. (1995). Of chicken teeth and mouse eyes, or generalized character compatibility. In: Galil, Z., Ukkonen, E. (eds) Combinatorial Pattern Matching. CPM 1995. Lecture Notes in Computer Science, vol 937. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60044-2_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-60044-2_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60044-2

  • Online ISBN: 978-3-540-49412-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation