Skip Navigation

Systematic Biology 2005 54(3):363-372; doi:10.1080/10635150590945377
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (PDF) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (24)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cassens, I.
Right arrow Articles by Milinkovitch, M. C.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Cassens, I.
Right arrow Articles by Milinkovitch, M. C.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2005 Society of Systematic Biologists

Evaluating Intraspecific "Network" Construction Methods Using Simulated Sequence Data: Do Existing Algorithms Outperform the Global Maximum Parsimony Approach?

Insa Cassens, Patrick Mardulyn and Michel C. Milinkovitch

Laboratory of Evolutionary Genetics, Institute of Molecular Biology and Medicine, Université Libre de Bruxelles rue Jeener et Brachet 12, 6041 Gosselies Belgium E-mail: pmarduly{at}ulb.ac.be P.M.

Edited by Mike Steel: Associate Editor


   Abstract

In intraspecific studies, reticulated graphs are valuable tools for visualization, within a single figure, of alternative genealogical pathways among haplotypes. As available software packages implementing the global maximum parsimony (MP) approach only give the possibility to merge resulting topologies into less-resolved consensus trees, MP has often been neglected as an alternative approach to purely algorithmic (i.e., methods defined solely on the basis of an algorithm) "network" construction methods. Here, we propose to search tree space using the MP criterion and present a new algorithm for uniting all equally most parsimonious trees into a single (possibly reticulated) graph. Using simulated sequence data, we compare our method with three purely algorithmic and widely used graph construction approaches (minimum-spanning network, statistical parsimony, and median-joining network). We demonstrate that the combination of MP trees into a single graph provides a good estimate of the true genealogy. Moreover, our analyses indicate that, when internal node haplotypes are not sampled, the median-joining and MP methods provide the best estimate of the true genealogy whereas the minimum-spanning algorithm shows very poor performances.

Keywords: Intraspecific genealogy; maximum parsimony; median-joining; minimum spanning; network; reticulated graph; statistical parsimony; simulated sequence data

Received March 3, 2004; Revised May 6, 2004; Accepted December 14, 2004
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
J HeredHome page
R. M. Jennings, T. M. Shank, L. S. Mullineaux, and K. M. Halanych
Assessment of the Cape Cod Phylogeographic Break Using the Bamboo Worm Clymenella torquata Reveals the Role of Regional Water Masses in Dispersal
J. Hered., January 1, 2009; 100(1): 86 - 96.
[Abstract] [Full Text] [PDF]


Home page
Mol Biol EvolHome page
M. Arenas, G. Valiente, and D. Posada
Characterization of Reticulate Networks Based on the Coalescent with Recombination
Mol. Biol. Evol., December 1, 2008; 25(12): 2517 - 2520.
[Abstract] [Full Text] [PDF]


Home page
Syst BiolHome page
S. Joly, M. I. Stevens, and B. J. van Vuuren
Haplotype Networks Can Be Misleading in the Presence of Missing Data
Syst Biol, October 1, 2007; 56(5): 857 - 862.
[Full Text] [PDF]


Home page
Syst BiolHome page
P. A. Reeves and C. M. Richards
Distinguishing Terminal Monophyletic Groups from Reticulate Taxa: Performance of Phenetic, Tree-Based, and Network Procedures
Syst Biol, April 1, 2007; 56(2): 302 - 320.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
M. M. Morin and B. M. E. Moret
NETGEN: generating phylogenetic networks with diploid hybrids
Bioinformatics, August 1, 2006; 22(15): 1921 - 1923.
[Abstract] [Full Text] [PDF]


Home page
Syst BiolHome page
T. Sota and M. Sasabe
Utility of Nuclear Allele Networks for the Analysis of Closely Related Species in the Genus Carabus, Subgenus Ohomopterus
Syst Biol, April 1, 2006; 55(2): 329 - 344.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.