A simulated annealing algorithm for finding consensus sequences

Bioinformatics

Volumn 18, Issue 11, 2002, Pages 1494-1499

  Keith, Jonathan M ^a   Adams, Peter ^a   Bryant, Darryn ^a   Kroese, Dirk P ^a   Mitchelson, Keith R ^a   Coachran, Duncan A E ^a   Lala, Gita H ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTIC METHOD; ARTICLE; COMPUTER PROGRAM; CONSENSUS SEQUENCE; CONTROLLED STUDY; GENETIC ALGORITHM; LINEAR SYSTEM; PERFORMANCE; PRIORITY JOURNAL; PROCESS OPTIMIZATION; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SIMULATION; TIME; ALGORITHM; BIOLOGICAL MODEL; COMPUTER SIMULATION; DNA SEQUENCE; EVALUATION; GENETICS; METHODOLOGY; MONTE CARLO METHOD; PROBABILITY; QUALITY CONTROL; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY; STATISTICAL MODEL; VALIDATION STUDY;

ALGORITHMS; COMPUTER SIMULATION; CONSENSUS SEQUENCE; MARKOV CHAINS; MODELS, GENETIC; MODELS, STATISTICAL; MONTE CARLO METHOD; QUALITY CONTROL; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA;

EID: 0036855578     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/18.11.1494     Document Type: Article

References (18)

1. Altschul,S.F. and Lipman,D. (1989) Trees, stars, and multiple sequence alignment. SIAM J. Appl. Math., 49, 197-209.
2. Day,W.H. and McMorris,F.R. (1993) The computation of consensus patterns in DNA sequence. Math. Comput. Model., 17, 49-52.
3. Feng,D. and Doolittle,R.F. (1987) Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol., 25, 351-360.
4. Gelfand,A.F. and Smith,A.F.M. (1990) Sampling-based approaches to calculating marginal densities. J. Am. Stat. Assoc., 85, 398-409.
5. Geman,S. and Geman,D. (1984) Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE T. Pattern Anal., 6, 721-741.
6. Gilks,W.R., Richardson,S. and Spiegelhalter,D.J. (1996) Markov Chain Monte Carlo in Practice. Chapman and Hall.
7. Gusfield (1997) Algorithms on strings, trees and sequences. Cambridge University Press.
8. Hastings,W.K. (1970) Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57, 97-109.
9. Jiang,T. and Wang,L. (2002) Algorithmic methods for multiple sequence alignment. In Jiang,T., Xu,Y. and Zhang,M.Q. (eds), Current Topics in Computational Biology. MIT Press.
10. Keith,J.M., Kroese,D.P. and Bryant,D. (submitted) A generalised Markov chain sampler.
11. Kirkpatrick,S., Gelatt,C.D. and Vecchi,M.P. (1983) Optimization by simulated annealing. Science, 220, 671-680.
12. Li,M., Ma,B. and Wang,L. (2000) Near optimal multiple alignment within a band in polynomial time. In 32nd ACM Symposium on Theory of Computing (STOC2000). pp. 425-434.
13. Metropolis,N., Rosenbluth,A.W., Rosenbluth,M.N. and Teller,A.H. (1953) Equations of state calculations by fast computing machines. J. Chem. Phys., 21, 1087-1092.
14. Thompson,J.D., Gibson,T.J., Plewniak,F., Jeanmougin,F. and Higgins,D.G. (1997) The ClustalX windows interface: flexible strategies for multiple sequence alignment aided by quality analysis tools. Nucleic Acids Res., 25, 4876-4882.
15. Thompson,J.D., Higgins,D.G. and Gibson,T.J. (1994) CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, positions-specific gap penalties and weight matrix choice. Nucleic Acids Res., 22, 4673-4680.
16. Wang,L., Jiang,T. and Lawler,E.L. (1996) Approximation algorithms for tree alignments with a given phylogeny. Algorithmica, 16, 302-315.
17. Wang,L. and Gusfield,D. (1998) Improved approximation algorithms for tree alignment. J. Algorithms, 25, 255-273.
18. Wang,L., Jiang,T. and Gusfield,D. (2000) A more efficient approximation scheme for tree alignment. SIAM J. Comput., 30, 283-299.