NDLI: Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets

Content Provider	IEEE Xplore Digital Library
Author	Guillemot, S. Jansson, J. Wing-Kin Sung
Copyright Year	2004
Abstract	We investigate the computational complexity of inferring a smallest possible multilabeled phylogenetic tree (MUL tree) which is consistent with each of the rooted triplets in a given set. This problem has not been studied previously in the literature. We prove that even the very restricted case of determining if there exists a MUL tree consistent with the input and having just one leaf duplication is an NP-hard problem. Furthermore, we showthatthe general minimization problem is difficult to approximate, although a simple polynomial-time approximation algorithm achieves an approximation ratio close to our derived inapproximability bound. Finally, we provide an exact algorithm for the problem running in exponential time and space. As a by-product, we also obtain new, strong inapproximability results for two partitioning problems on directed graphs called Acyclic Partition and Acyclic Tree-Partition.
Sponsorship	IEEE Computer Society
Page Count	7
File Size	309236
Starting Page	1141
Ending Page	1147
File Format	PDF
ISSN	15455963
Volume Number	8
Issue Number	4
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-07-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Phylogeny Approximation algorithms Bioinformatics Approximation methods Polynomials Heuristic algorithms Pediatrics dynamic programming. Phylogenetics MUL tree rooted triplet acyclic tree-partition inapproximability
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Genetics Biotechnology

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

Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets

Using Max Cut to Enhance Rooted Trees Consistency

Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets

Do Triplets Have Enough Information to Construct the (2013)

Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds

Metrics for Phylogenetic Networks II: Nodal and Triplets Metrics

Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem

New Heuristics for Rooted Triplet Consistency

A new heuristic algorithm for mrtc problem (2012).

Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets

Similar Documents

Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets

Using Max Cut to Enhance Rooted Trees Consistency

Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets

Do Triplets Have Enough Information to Construct the (2013)

Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds

Metrics for Phylogenetic Networks II: Nodal and Triplets Metrics

Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem

New Heuristics for Rooted Triplet Consistency

A new heuristic algorithm for mrtc problem (2012).

Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets