Adv Appl Bioinform Chem. 2010;3:89-96. doi: 10.2147/AABC.S13397. Epub 2010 Nov 16.
Construction of random perfect phylogeny matrix.
Advances and applications in bioinformatics and chemistry : AABC
Mehdi Sadeghi, Hamid Pezeshk, Changiz Eslahchi, Sara Ahmadian, Sepideh Mah Abadi
Affiliations
Affiliations
- National Institute of Genetic Engineering and Biotechnology, Tehran, Iran.
PMID: 21918630
PMCID: PMC3170006 DOI: 10.2147/AABC.S13397
Abstract
PURPOSE: Interest in developing methods appropriate for mapping increasing amounts of genome-wide molecular data are increasing rapidly. There is also an increasing need for methods that are able to efficiently simulate such data.
PATIENTS AND METHODS: In this article, we provide a graph-theory approach to find the necessary and sufficient conditions for the existence of a phylogeny matrix with k nonidentical haplotypes, n single nucleotide polymorphisms (SNPs), and a population size of m for which the minimum allele frequency of each SNP is between two specific numbers a and b.
RESULTS: We introduce an O(max(n(2), nm)) algorithm for the random construction of such a phylogeny matrix. The running time of any algorithm for solving this problem would be Ω (nm).
CONCLUSION: We have developed software, RAPPER, based on this algorithm, which is available at http://bioinf.cs.ipm.ir/softwares/RAPPER.
Keywords: minimum allele frequency (MAF); perfect phylogeny; recursive algorithm; tree
References
- J Hered. 2000 Nov-Dec;91(6):506-9 - PubMed
- Bioinformatics. 2004 Dec 12;20(18):3673-5 - PubMed
- J Comput Biol. 2003;10(3-4):323-40 - PubMed
- BMC Genet. 2006 Mar 15;7:16 - PubMed
- Bioinformatics. 2002 Feb;18(2):337-8 - PubMed
- Bioinformatics. 2003 Jan 22;19(2):289-90 - PubMed
- BMC Bioinformatics. 2005 Oct 14;6:252 - PubMed
- J Bioinform Comput Biol. 2003 Apr;1(1):1-20 - PubMed
- Bioinformatics. 2005 Dec 1;21(23):4309-11 - PubMed
- Bioinformatics. 2007 Feb 15;23(4):520-1 - PubMed
Publication Types