Phylogenetic Trees Construction with Compressed DNA Sequences Using GENBIT COMPRESS Tool
暂无分享,去创建一个
[1] Durbin,et al. Biological Sequence Analysis , 1998 .
[2] Li Wei,et al. Compression-based data mining of sequential data , 2007, Data Mining and Knowledge Discovery.
[3] David Sankoff,et al. Multiple Genome Rearrangement and Breakpoint Phylogeny , 1998, J. Comput. Biol..
[4] M. Gerstein,et al. Analysis of yeast protein kinases using protein chips , 2000, Nature Genetics.
[5] Johannes Fischer,et al. A 2-Approximation Algorithm for Sorting by Prefix Reversals , 2005, ESA.
[6] R. Ravi,et al. Of mice and men: algorithms for evolutionary distances between genomes with translocation , 1995, SODA '95.
[7] Alfonso Ortega,et al. Common Pitfalls Using the Normalized Compression Distance: What to Watch Out for in a Compressor , 2005, Commun. Inf. Syst..
[8] Pavel A. Pevzner,et al. Towards a Computational Theory of Genome Rearrangements , 1995, Computer Science Today.
[9] Ziheng Yang. Phylogenetic analysis using parsimony and likelihood methods , 1996, Journal of Molecular Evolution.
[10] J. Hartigan,et al. Statistical Analysis of Hominoid Molecular Evolution , 1987 .
[11] Michael Y. Galperin,et al. Comparative genome analysis. , 2001, Methods of biochemical analysis.
[12] N. Saitou,et al. The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.
[13] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[14] H. Munro,et al. Mammalian protein metabolism , 1964 .
[15] Eamonn J. Keogh,et al. Towards parameter-free data mining , 2004, KDD.
[16] Rudi Cilibrasi,et al. Statistical inference through data compression , 2007 .
[17] J. Thompson,et al. The CLUSTAL_X windows interface: flexible strategies for multiple sequence alignment aided by quality analysis tools. , 1997, Nucleic acids research.
[18] David Sankoff,et al. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement , 1995, Algorithmica.
[19] Raffaele Giancarlo,et al. Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment , 2007, BMC Bioinformatics.
[20] M. Kimura. A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences , 1980, Journal of Molecular Evolution.
[21] H. Kishino,et al. Evaluation of the maximum likelihood estimate of the evolutionary tree topologies from DNA sequence data, and the branching order in hominoidea , 1989, Journal of Molecular Evolution.
[22] Paul M. B. Vitányi,et al. Clustering by compression , 2003, IEEE Transactions on Information Theory.
[23] Paolo Ferragina,et al. The BioPrompt-box: an ontology-based clustering tool for searching in biological databases , 2007, BMC Bioinformatics.