Location of Repository

Direct maximum parsimony phylogeny reconstruction from genotype data

By Srinath Sridhar, Fumei Lam, Guy E Blelloch, R Ravi and Russell Schwartz
Topics: Research Article
Publisher: BioMed Central
OAI identifier: oai:pubmedcentral.nih.gov:2222657
Provided by: PubMed Central
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.pubmedcentral.nih.g... (external link)
  • Suggested articles

    Preview

    Citations

    1. (1984). A dual ascent approach for Steiner tree problems on a directed graph. Math Program
    2. (2006). A fast and flexible statistical model for large-scale population genotype data: applications to inferring missing genotypes and haplotypic phase.
    3. A linear-time algorithm for perfect phylogeny haplotyping.
    4. (2001). A new statistical method for haplotype reconstruction from population data.
    5. (2003). A polynomial-time algorithm for near-perfect phylogeny.
    6. (2004). Achtman M: Distinguishing human ethnic groups by means of sequences from Helicobacter pylori: Lessons from Ladakh. Proc Natl Acad Sci USA
    7. (2007). Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice.
    8. Algorithms for imperfect phylogeny haplotyping with a single homoplasy or recombination event.
    9. (2006). Angius A: High resolution analysis and phylogenetic network construction using complete mtDNA sequences in Sardinian genetic isolates. Mol Biol Evol
    10. (2002). Bayesian haplotype inference for multiple linked single nucleotide polymorphisms.
    11. (1998). Better methods for solving parsimony and compatibility.
    12. (1987). Boerwinkle E, Sing CF: A cladistic analysis of phenotypic associations with haplotypes inferred from restriction endonuclease mapping. Genetics
    13. (1998). Boerwinkle E, Sing CF: Haplotype structure and population genetic inferences from nucleotide-sequence variation in human lipoprotein lipase.
    14. (2003). Efficient reconstruction of haplotype structure via perfect phylogeny.
    15. Efficiently finding the most parsimonious phylogenetic tree via linear programming.
    16. (2004). Eskin E: Haplotype reconstruction from genotype data using imperfect phylogeny. Bioinformatics
    17. (1989). From copair hypergraphs to median graphs with latent vertices.
    18. (2002). Generating samples under a Wright-Fisher neutral model. Bioinformatics
    19. (1997). Grassly NC: Seq-gen: An application for the Monte Carlo simulation of DNA Sequence evolution along phylogenetic trees. Comput Appl Biosci
    20. Haplotype Inference by Pure Parsimony.
    21. Haplotyping as perfect phylogeny: Conceptual framework and efficient solutions.
    22. (1990). Inference of haplotypes form PCR-amplified samples of diploid populations. Mol Biol Evol
    23. (1989). MB: Mitochondrial portraits of human populations using median networks. Genetics
    24. Optimal imperfect phylogeny reconstruction and haplotyping (IPPH).
    25. PHYLIP (Phylogeny Inference Package) version
    26. (2003). Phylogenetics Oxford
    27. (1982). RL: The Steiner problem in phylogeny is NP-complete.
    28. (2004). S: A note on efficient computation of haplotypes via perfect phylogeny.
    29. Simple reconstruction of binary near-perfect phylogenetic trees.
    30. Sridhar S: Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction.
    31. (2000). ST: dbSNP: a database of single nucleotide polymorphisms. Nucleic Acids Res
    32. The recovery of trees from measures of dissimilarity.
    33. (2003). Verrelli BC: Patterns of human genetic diversity: implications for human evolutionary history and disease. Annu Rev Genomics Hum Genet
    34. Warnow T: Better hill-climbing searches for parsimony.
    35. (2003). Yang Z: Bayes estimation of species divergence times and ancestral population sizes using DNA sequences from multiple loci. Genetics
    36. (2003). Yooseph S: Haplotyping as perfect phylogeny: A direct approach.

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.