Visualization of near-optimal sequence alignments

Bioinformatics

Volumn 20, Issue 6, 2004, Pages 953-958

  Smoot, Michael E ^a   Guerlain, Stephanie A ^a   Pearson, William R ^a  

^a UNIVERSITY OF VIRGINIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

ARTICLE; COMPUTER PROGRAM; CONTROLLED STUDY; DISPLAY SYSTEM; DNA SEQUENCE; GENETIC ALGORITHM; GENETIC DATABASE; INTERNET; METHODOLOGY; PRIORITY JOURNAL; PROTEIN ANALYSIS; SEQUENCE ALIGNMENT;

EID: 2342417734     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bth013     Document Type: Article

References (18)

1. Altschul ,S.F., Gish, W., Miller, W., Myers, E.W. and Lipman, D.J. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410.
2. Brill, E.D., Flach, J.M., Hopkins, L.D. and Ranjithan, S. (1990) MGA: a decision support system for complex incompletely defined problems. IEEE Trans. Sys. Man Cyber., 20, 745-757.
3. Gotoh, O. (1982) An improved algorithm for matching biological sequences. J. Mol. Biol., 162, 705-708.
4. Guerlain, S. (2000) Interactive advisory systems. Proceedings of the Human Performance, Situation Awareness and Automation Conference, Savannah, GA, pp. 166-171.
5. Kahneman, D., Slovic, P. and Tversky, A. (1982) Judgment Under Uncertainty: Heuristics and Biases. Cambridge University Press, Cambridge, UK.
6. Layton ,C., Smith, P.J. and McCoy, E. (1994) Design of a cooperative problem-solving system for en-route flight planning: an empirical evaluation. Hum. Factors, 36, 94-119.
7. Naor, D. and Brutlag, D.L. (1994) On near-optimal alignments of biological sequences. J. Comp. Biol., 4, 349-366.
8. Needleman, S.B. and Wunsch, C.D. (1970) A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. Mol. Biol., 48, 443-453.
9. Parasuraman, R., Molloy, R. and Singh, I.L. (1993) Performance consequences of automation-induced complacency. Int. J. Aviat. Psychol., 3, 1-23.
10. Pearson, W.R. and Lipman, D.J. (1988) Improved tools for biological sequence analysis. Proc. Natl Acad. Sci., USA, 85, 2444-2448.
11. Saqi, M.A.S., Russell, R.B. and Sternberg, M.J.E. (1998) Misleading local sequence alignments: implications for comparative protein modeling. Protein Eng., 11, 627-630.
12. Sellers, P.H. (1974) An algorithm for the distance between two finite sequences. J. Comb. Theory (A), 16, 253-258.
13. Smith, T.F. and Waterman, M.S. (1981) Identification of common molecular subsequences.J. Mol. Biol., 147, 195-197.
14. Stajich, J.E., Block, D., Boulez, K., Brenner, S.E., Chervitz, S.A., Dagdigian, C., Fuellen, G., Gilber, J.G.R., Korf, I., Lapp, H. et al. (2002) The BioPerl toolkit: Perl modules for the life sciences. Genome Res., 12, 1611-1618.
15. Vicente, K.J. (1999) Cognitive Work Analysis. Lawrence Earlbaum Associates, Mahwah, New Jersey, USA.
16. Waterman, M.S. and Byers, T.H. (1985) A dynamic programming algorithm to find all solutions in a neighborhood of the optimum. Math. Biosci., 77, 179-188.
17. Zuker, M. (1989) On finding all suboptimal foldings of an RNA molecule. Science, 244, 48-53.
18. Zuker, M. (1991) Suboptimal sequence alignment in molecular biology: analysis with errors. J. Mol. Biol., 221, 403-420.