Parameterizing sequence alignment with an explicit evolutionary model

BMC Bioinformatics

Volumn 16, Issue 1, 2015, Pages

  Rivas, Elena ^a   Eddy, Sean R ^a,b,c,d  

^a HARVARD UNIVERSITY   (United States)

^b HOWARD HUGHES MEDICAL INSTITUTE   (United States)

^c HARVARD UNIVERSITY   (United States)

^d HARVARD UNIVERSITY   (United States)

Author keywords

Evolutionary models; Hidden Markov models; Insertions and deletions

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONVOLUTIONAL CODES; COSTS; MARKOV PROCESSES; PARALLEL PROCESSING SYSTEMS;

ALGORITHMIC COMPLEXITY; EVOLUTIONARY MODELS; INSERTIONS AND DELETIONS; PAIRWISE ALIGNMENT; PAIRWISE SEQUENCE ALIGNMENT; PROFILE HIDDEN MARKOV MODEL; SEQUENCE ALIGNMENTS; TECHNICAL DIFFICULTIES;

HIDDEN MARKOV MODELS;

ADOPTION; ARTIFACT; DNA FLANKING REGION; EXPECTATION; INDEL MUTATION; SEQUENCE ALIGNMENT; ALGORITHM; HUMAN; MOLECULAR EVOLUTION; PROBABILITY; STATISTICAL MODEL; THEORETICAL MODEL;

ALGORITHMS; EVOLUTION, MOLECULAR; HUMANS; MODELS, STATISTICAL; MODELS, THEORETICAL; PROBABILITY; SEQUENCE ALIGNMENT;

EID: 84949773786     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/s12859-015-0832-5     Document Type: Article

References (46)

1. Altschul SF, Madden TL, Schaffer AA, Zhang J, Zhang Z, Miller W, et al. Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucl Acids Res. 1997; 25:3389-402.
2. Eddy SR. Profile hidden Markov models. Bioinformatics. 1998; 14:755-63.
3. Durbin R, Eddy SR, Krogh A, Mitchison GJ. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge UK: Cambridge University Press; 1998.
4. Altschul SF. A protein alignment scoring system sensitive at all evolutionary distances. J Mol Evol. 1993; 36:290-300.
5. Thorne JL, Kishino H, Felsenstein J. An evolutionary model for maximum likelihood alignment of DNA sequences. J Mol Evol. 1991; 33:114-24.
6. Thorne JL, Kishino H, Felsenstein J. Inching toward reality: an improved likelihood model of sequence evolution. J Mol Evol. 1992; 34:3-16.
7. Bishop MJ, Friday AE. Evolutionary trees from nucleic acid and protein sequence. Proc R Soc B. 1985; 226:271-302.
8. Bishop MJ, Thompson EA. Maximum likelihood alignment of DNA sequences. J Mol Biol. 1986; 190:159-65.
9. Metzler D, Fleissner D, Wakolbinger A, von Haeseler A. Assessing variability by joint sampling of alignments and mutation rates. J Mol Evol. 2001; 53:660-9.
10. Bouchard-Côté A, Jordan MI. Evolutionary inference via the Poisson indel process. 2012. PNAS 10.1073/pnas.1220450110.
11. Mitchison GJ, Durbin RM. Tree-based maximal likelihood substitution matrices and hidden Markov models. J Mol Evol. 1995; 41:1139-51.
12. Mitchison GJ. A probabilistic treatment of phylogeny and sequence alignment. J Mol Evol. 1999; 49:11-22.
13. Qian B, Goldstein RA. Detecting distant homologs using phylogenetic tree-based HMMs. Proteins. 2003; 52:446-53.
14. McGuire AM, Hughes JD, Church GM. Conservation of DNA regulatory motifs and discovery of new motifs in microbial genomes. Genome Res. 2000; 10:744-57.
15. Rivas E, Eddy SR. Probabilistic phylogenetic inference with insertions and deletions. PLoS Comput Biol. 2008; 4:1000172.
16. Knudsen B, Miyamoto MM. Sequence alignments and pair hidden Markov models using evolutionary history. J Mol Biol. 2003; 333:453-60.
17. Miklós I, Toroczkai Z. An improved model for statistical aligment In: Gascuel O, Moret BME, editors. WABI 2001. Berlin Heidelberg: Springer: 2001. p. 1-10.
18. Miklós I, Lunter GA, Holmes I. A "Long Indel" model for evolutionary sequence alignment. Mol Biol Evol. 2004; 21:529-40.
19. Reese JT, Pearson WR. Empirical determination of effective gap penalties for sequence comparison. Bioinformatics. 2002; 18:1500-7.
20. Pearson WR. Flexible sequence similarity searching with the FASTA3 program package. Meth Mol Biol. 2000; 132:185-219.
21. Eddy SR. Accelerated profile HMM searches. PLoS Comp Biol. 2011; 7:1002195.
22. Finn RD, Clements J, Eddy SR. HMMER web server: Interactive sequence similarity searching. Nucl Acids Res. 2011; 39:29-37.
23. Punta M, Coggill PC, Eberhardt RY, Mistry J, Tate J, Boursnell C, et al. The Pfam protein families database. NAR. 2012; 40:290-301.
24. Wheeler TJ, Clements J, Eddy SR, Hubley R, Jones TA, Jurka J, et al. Dfam: a database of repetitive DNA based on profile hidden Markov models. Nucl Acids Res. 2013; 41:70-82.
25. Eddy SR. A probabilistic model of local sequence alignment that simplifies statistical significance estimation. PLoS Comput Biol. 2008; 4:1000069.
26. Karplus K. SAM-T08, HMM-based protein structure prediction. Nucleic Acids Res. 2009; 21:492-7.
27. Gonzalez MW, Pearson WR. Homologous over-extension: a challenge for iterative similarity searches. Nucl Acids Res. 2010; 38:2177-89.
28. Mills LJ, Pearson WR. Adjusting scoring matrices to correct overextended alignments. Bioinformatics. 2013; 29:3007-13.
29. Lunter G. Probabilistic whole-genome alignments reveal high indel rates in the human and mouse genomes. Bioinformatics. 2007; 23:289-96.
30. Wang J, Keightley PD, Johnson T. MCALIGN2: Faster, accurate global pairwise alignment of non-coding DNA sequences based on explicit models of indel evolution. BMC Bioinformatic. 2006; 7:292.
31. Cartwright RA. Problems and solutions for estimating indel rates and length distributions. Mol Biol Evol. 2009; 26(2):473-80.
32. Krogh A, Brown M, Mian IS, Sjölander K, Haussler D. Hidden Markov models in computational biology: Applications to protein modeling. J Mol Biol. 1994; 235:1501-31.
33. Hein J. An algorithm for statistical alignment of sequences related by a binary tree. Pac Symp Biocomput. 2001; 6:179-90.
34. Smith TF, Waterman MS. Identification of common molecular subsequences. J Mol Biol. 1981; 147:195-7.
35. Pearson WR. Comparison of methods for searching protein sequence databases. Protein Sci. 1995; 4:1145-60.
36. Pearson WR. Selecting the right similarity-scoring matrix. Curr Protocol Bioinform. 2013; 3:3-5351359.
37. Rivas E. Evolutionary models for insertions and deletions in a probabilistic modeling framework. BMC Bioinformatics. 2005; 6:63.
38. Edgar RC. Quality measures for protein alignment benchmarks. Nucleic Acids Res. 2010; 38:2145-53.
39. Van Walle I, Lasters I, Wyns L. SABmark-a benchmark for sequence alingnment that covers the entire known fold space. Bioinformatics. 2005; 1:293-303.
40. van Rijsbergen CJ. Information Retrival. London: London Butterworths; 1979.
41. Mirarab S, Warnow T. FastSP: Linear time calculation of alignment accuracy. Bioinformatics. 2011; 27:3250-8.
42. Camacho C, Coulouris G, Avagyan V, Ma N, Papadopoulos J, Bealer K, et al. BLAST+: Architecture and applications. BMC Bioinformatics. 2009; 10:421.
43. Liu Y, Schmidt B, Maskell DL. MSAProbs: multiple sequence alignment based on pair hidden Markov models and partition function posterior probabilities. Bioinformatics. 2010; 26:1958-64.
44. Edgar RC. MUSCLE: a multiple sequence alignment method with reduced time and space complexity. BMC Bioinformatics. 2004; 5:113.
45. Müller T, Spang R, Vingron M. A comparison of Dayhoff's estimator, the resolvent approach and a maximum likelihood method. Mol Biol Evol. 2002; 19:8-13.
46. The UniProt Consortium. UniProt: a hub for protein information. Nucl. Acids Res. 2015; 43(D1):D204-D212. [doi: 10.1093/nar/gku989 ].