NDLI: Inferring perfect phylogenies with restrictions on character state transitions

Content Provider	IEEE Xplore Digital Library
Author	Truszkowski, J. Giaro, K.
Copyright Year	2008
Description	Author affiliation: Gdansk Univ. of Technol., Gdansk (Truszkowski, J.)
Abstract	One of the important problems in evolutionary biology is inferring phylogenetic trees for sets of related species. We introduce a new model for inferring phylogenies which is a generalization of the widely studied perfect phylogeny model. The perfect phylogeny model assumes that a feature shared by a set of species cannot have evolved independently in any two of the species in the set, i.e. the species with this feature form a subtree in the correct phylogenetic tree. We briefly review earlier similar results on this subject and describe the difference between our model and the ones previously investigated. It turns out that the problem of finding a perfect phylogeny with restrictions is NP-complete even if the number of characters is 2. This contrasts with the complexity of finding unrestricted perfect phylogenies. On the other hand, the new model shows similar properties to the classical perfect phylogeny model in case where the number of cycles in each state transition graph is bounded by a small constant.
Starting Page	1
Ending Page	4
File Size	501528
Page Count	4
File Format	PDF
ISBN	9781424422449
DOI	10.1109/INFTECH.2008.4621668
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-05-18
Publisher Place	Poland
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Biological system modeling Teeth Programming Polynomials Phylogeny Complexity theory History
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies (1995)

A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies (1996)

Complexity of the Mixed Postman Problem with Restrictions on the Edges

Quartet based phylogeny reconstruction with answer set programming

Generalizing the splits equivalence theorem and four gamete condition: perfect phylogeny on three state characters (905).

Construction, enumeration, and optimization of perfect phylogenies on multi-state data

Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems

A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed

A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies

Inferring perfect phylogenies with restrictions on character state transitions

Similar Documents

A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies (1995)

A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies (1996)

Complexity of the Mixed Postman Problem with Restrictions on the Edges

Quartet based phylogeny reconstruction with answer set programming

Generalizing the splits equivalence theorem and four gamete condition: perfect phylogeny on three state characters (905).

Construction, enumeration, and optimization of perfect phylogenies on multi-state data

Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems

A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed

A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies

Inferring perfect phylogenies with restrictions on character state transitions