Bioinformatics and Management Science: Some Common Tools and Techniques

References

• Altschul S. F., Gish W., Miller W., Myers E., Lipman J. Basic local alignment search tool. J. Molecular Biol. (1990) 215:403–410Crossref, Google Scholar
• Altschul S. F., Madden T. L., Schaffer A. A., Zhang J., Zhang Z., Miller W., Lipman D. J. Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucleic Acids Res. (1997) 25:3389–3402Crossref, Google Scholar
• Apaydin M. S., Brutlag D. L., Guestrin C., Hsu D., Latombe J. C. Stochastic roadmap simulation: An efficient representation and algorithm for analyzing molecular motion. (2002) (Washington, DC)12–21RECOMB2002Crossref, Google Scholar
• Baldi P., Brunak S.Bioinformatics: The Machine Learning Approach (2001) 2nd ed.(MIT Press, Cambridge, MA) Google Scholar
• Baldi P., Wesley Hatfield G.Microarrays and Gene Expression (2001) (Cambridge University Press, Cambridge, U.K.) Google Scholar
• Baldi P., Chauvin Y., Hunkapillar T., McClure M. Hidden Markov models of biological primary sequence information. Proc. National Acad. Sci. USA (1994) 91:1059–1063Crossref, Google Scholar
• Bateman A., Birney E., Cerruti L., Durbin R., Etwiller L., Eddy S. R., Griffiths-Jones S., Howe K. L., Marshall M., Sonnhammer E. L. L. The Pfam protein families database. Nucleic Acids Res. (2002) 30(1):276–280Crossref, Google Scholar
• Beeman D. Some multi-step methods for use in molecular dynamics calculations. J. Comput. Phys. (1976) 20:130–139Crossref, Google Scholar
• Berman H. M., Westbrook J., Feng Z., Gilliland G., Bhat T. N., Weissig H., Shindyalov I. N., Bourne P. E. The protein data bank. Nucleic Acids Res. (2000) 28:235–242Crossref, Google Scholar
• Bork P., Dandekar T., Diaz-Lazcoz Y., Eisenhaber F., Huynen M., Yuan Y. Predicting function: From genes to genomes and back. J. Molecular Biol. (1998) 283:707–725Crossref, Google Scholar
• Bourne P. E. CASP and CAFASP experiments and their findings. Methods Biochem. Anal. (2003) 44:501–507Google Scholar
• Bower J., Bolouri H.Computational Modeling of Genetic and Biochemical Networks (2001) (MIT Press, Cambridge, MA) Google Scholar
• Bray N., Dubchak I., Pachter L. AVID: A global alignment program. Genome Res. (2003) 13(1):97–102Crossref, Google Scholar
• Brown P. O., Botstein D. Exploring the new world of the genome with DNA microarrays. Nature Genetics (1999) 21:33–37Crossref, Google Scholar
• Brudno M., Do C. B., Cooper G. M., Kim M. F., Davydov E., Green E. D., Sidow A., Batzoglou A. LAGAN and multi-LAGAN: Efficient tools for large-scale multiple alignment of genomic DNA. Genome Res. (2003a) 13(4):721–731Crossref, Google Scholar
• Brudno M., Malde S., Poiakov A., Do C., Couronne O., Dubchak I., Batzoglou S. Glocal alignment: Finding rearrangements during alignment. Bioinformatics (2003b) 19:54i–62i(Special Issue on the Proceedings of the ISMB 2003)Crossref, Google Scholar
• Bryant S. H., Altschul S. F. Statistics of sequence-structure threading. Current Opinion in Structural Biol. (1995) 5:236–244Crossref, Google Scholar
• Burge C., Karlin S. Prediction of complete gene structures in human genomic DNA. J. Molecular Biol. (1997) 268:78–94Crossref, Google Scholar
• Cohen F. E. Protein misfolding and prion diseases. J. Molecular Biol. (1999) 293:313–320Crossref, Google Scholar
• Dayhoff M. O., Schwartz R. M., Orcutt B. C. A model of evolutionary change in proteins. Atlas of Protein Sequence and Structure (1978) 5(Supplement 3(National Biomedical Research Foundation, Washington, D.C.) 345–352Google Scholar
• Delcher A. L., Phillippy A., Carlton J., Salzberg S. L. Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Res. (2002) 30:2478–2483Crossref, Google Scholar
• Diaconis P., Holmes S. Random walks on trees and matchings. Electronic J. Probab. (2002) 7:1–17Crossref, Google Scholar
• Doyle J. C. Robustness and dynamics in biological networks. The First International Conf. Systems Biology (2000) New York(Japan Science and Technology Corporation, MIT Press)Google Scholar
• Dudoit S., Fridlyand J., Speed T. P. Comparison of discrimination methods for the classification of tumors using gene expression data. J. Amer. Statist. Association (2002) 97:77–87Crossref, Google Scholar
• Durbin S., Eddy S., Krogh A., Mitchison G.Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids (1998) (Cambridge University Press, Cambridge, U.K.) Crossref, Google Scholar
• Eddy S. Profile hidden Markov models. Bioinformatics (1998) 14:755–763Crossref, Google Scholar
• Eddy S. Non-coding RNA genes and the modern RNA world. Nature Rev. Genetics (2001) 2:919–929Crossref, Google Scholar
• Eddy S., Mitchison G., Durbin R. Maximum discrimination hidden Markov models of sequence consensus. J. Comput. Biol. (1995) 2:9–23Crossref, Google Scholar
• Efron B., Halloran E., Holmes S. Bootstrap confidence levels for phylogenetic trees. Proc. National Acad. Sci. (1996) 93:13429–13434Crossref, Google Scholar
• Farris J. S., Platnick N. I., Funk V. A. The logical basis of phylogenetic analysis. Advances in Cladistics (1983) 2(Columbia University Press, New York) 7–36Google Scholar
• Fedorov A. N., Baldwin T. O. Contranslational protein folding. J. Biol. Chemistry (1997) 272(52):32715–32718Crossref, Google Scholar
• Felsenstein J. Evolutionary trees from DNA sequences: A maximum likelihood approach. J. Molecular Evol. (1981) 17(6):368–376Crossref, Google Scholar
• Felsenstein J. PHYLIP(Phylogeny Inference Package), version 3.6. (2004) (Department of Genetics, University of Washington, Seattle, WA) . http://evolution.genetics.washington.edu/phylip.htmlGoogle Scholar
• Fischer D., Barret C., Bryson K., Elofsson A., Godzik A., Jones D., Karplus K. J., Kelley L. A., MacCallum R. M., Pawowski K., Rost B., Rychlewski L., Sternberg M. CAFASP-1: Critical assessment of fully automated structure prediction methods. Proteins (1999) 3:209–217Crossref, Google Scholar
• Fitch W. M., Margoliash E. Construction of phylogenetic trees. Science (1967) 155:279–284Crossref, Google Scholar
• Foulds L. R., Graham R. L. The Steiner problem in phylogeny is NP-complete. Adv. Appl. Math. (1982) 3:43–49Crossref, Google Scholar
• Friedman N., Linial M., Nachman I., Peter D. Using Bayesian networks to analyze expression data. J. Comput. Biol. (2000) 7:601–620Crossref, Google Scholar
• Gardner M.The Last Recreations (1997) (Copernicus-Springer Verlag, New York) Crossref, Google Scholar
• Geman S., Geman D. Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Machine Intelligence (1984) 6:721–741Crossref, Google Scholar
• Gibson K. D., Scheraga H. A. Revised algorithms for the build-up procedure for predicting protein conformations by energy minimization. J. Comput. Chem. (1987) 9:327–355Google Scholar
• Goloboff P. A. SPA, (S)ankoff (P)arsimony (A)nalysis, version 1.1. (1995) . Computer program distributed by J. M. Carpenter, Department of Entomology, American Museum of Natural History, New YorkGoogle Scholar
• Golub T., Slonim D., Tamayo P., Huard C., Gassenbeek M., Mesirov J., Coller H., Loh M., Downing J., Caligiuri M., Bloomfield C., Lander E. Molecular classification of cancer: Class discovery and class prediction by gene expression monitoring. Science (1999) 286:531–537Crossref, Google Scholar
• Gotoh O. An improved algorithm for matching biological sequences. J. Molecular Biol. (1982) 162:705–708Crossref, Google Scholar
• Gribaldo S., Cammarano P. The root of the universal tree of life inferred from anciently duplicated genes encoding components of the protein-targeting machinery. J. Molecular Evol. (1998) 47(5):508–516Crossref, Google Scholar
• Haeckel E.Morphologie der Organismen: Allgemeine Grundzuge der organischen FormenWissenschaft, mechanisch begrundet durch die von Charles Darwin reformirte Descendenz-Theorie (1866) (Georg Riemer, Berlin, Germany) Crossref, Google Scholar
• Hannenhalli S., Pevzner P. A. Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. STOC (1995) (Las Vegas, NV)178–189Crossref, Google Scholar
• Helden J. V., Andre B., Collado-Vides J. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J. Molecular Biol. (1998) 281:827–842Crossref, Google Scholar
• Henikoff S., Henikoff J. G. Amino acid substitution matrices from protein blocks. Proc. National Acad. Sci. USA (1992) 89:10915–10919Crossref, Google Scholar
• Holmes S. Bootstrapping phylogenetic trees: Theory and methods. Statist. Sci. (2003) 18(2):241–255Crossref, Google Scholar
• Hooper E.The River (1999) (Little, Brown, Boston, MA) Google Scholar
• Huelsenbeck J., Ronquist F. Mr. Bayes. Bayesian inference of phylogeny. (2002) . http://morphbank.ebc.uu.se/mrbayes/links.phpGoogle Scholar
• Jukes T., Cantor C., Munro H. N. Evolution of protein molecules. Mammalian Protein Metabolism (1969) (Academic Press, New York) 21–132Crossref, Google Scholar
• Karlin S., Altschul S. F. Methods for assessing the statistical significance of molecular sequences features by using general scoring schemes. Proc. National Acad. Sci. USA (1990) 87(6):2264–2268Crossref, Google Scholar
• Keith J. M., Adams P., Bryant D., Kroese D. P., Mitchelson K. R., Cochran D. A. E., Lala G. H. A simulated annealing algorithm for finding consensus sequences. Bioinformatics (2002) 18:1494–1499Crossref, Google Scholar
• Kent W. J. BLAT—The BLAST-like alignment tool. Genome Res. (2002) 12(4):656–664Crossref, Google Scholar
• Kirkpatrick S., Gelatt Jr C. D., Vecchi M. P. Optimization by simulated annealing. Science (1983) 220:671–680Crossref, Google Scholar
• Korf I., Flicek P., Duan D., Brent M. R. Integrating genomic homology into gene structure prediction. Bioinformatics (2001) 17:S140–S148Crossref, Google Scholar
• Krogh A., Brown M., Mian I. S., Sjolander K., Haussler D. Hidden Markov models in computational biology. J. Molecular Biol. (1994) 235:1501–1531Crossref, Google Scholar
• Lawrence C. E., Altschul S. F., Boguski M. S., Liu J. S., Neuwald A. N., Wootton J. Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment. Science (1993) 262:208–214Crossref, Google Scholar
• Levitt M. Protein folding by restrained energy minimization and molecular dynamics. J. Molecular Biol. (1983a) 170:723–764Crossref, Google Scholar
• Levitt M. Molecular dynamics of native protein: Computer simulation of the trajectories. J. Molecular Biol. (1983b) 168:595–620Crossref, Google Scholar
• Levitt M., Lifson S. Refinement of protein confirmations using a macromolecular energy minimization procedure. J. Molecular Biol. (1969) 46:269–279Crossref, Google Scholar
• Levitt M., Warshel A. Computer simulation of protein folding. Nature (1975) 253:694–698Crossref, Google Scholar
• Li S., Pearl D. K., Doss H. Phylogenetic tree construction using MCMC. J. Amer. Statist. Association (2000) 95:493–503Crossref, Google Scholar
• Li W. H.Molecular Evolution (1997) (Sinauer Associates, Boston, MA) Google Scholar
• Lipman J. D., Altschul S. F., Kececioglu J. D. A tool for multiple sequence alignment. Proc. National Acad. Sci. (1989) 86:4412–4415Crossref, Google Scholar
• Lukashin A., Engelbrecht J., Brunak S. Multiple alignment using simulated annealing: Branch point definition in human mRNA splicing. Nucleic Acids Res. (1992) 20:2511–2516Crossref, Google Scholar
• Ly D. H., Lockhart D. J., Lerner R. A., Schultz P. G. Mitotic misregulation and human aging. Science (2000) 287:1241–1248Crossref, Google Scholar
• Ma B., Tromp J., Li M. PatternHunter: Faster and more sensitive homology search. Bioinformatics (2002) 18:440–445Crossref, Google Scholar
• Ma B., Wang Z., Zhang K. Alignment between two multiple alignments. Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003 (2003) June 25–27Morelia, Michoacán, MexicoLecture Notes in Computer Science 2676. Springer-Verlag Heidelberg, Germany.Crossref, Google Scholar
• Maddison D., Maddison W.MacClade Vol. 4: Analysis of Phylogeny and Character Evolution (2000) (Sinauer Associates, Sunderland, MA) Google Scholar
• McAdams H., Shapiro L. Circuit simulation of genetic networks. Science (1995) 269:650–656Crossref, Google Scholar
• Metropolis N., Rosenbluth A., Rosenbluth M., Teller A., Teller E. Simulated annealing. J. Chem. Phys. (1953) 21:1087–1092Crossref, Google Scholar
• Mjolsness E., Sharp D. H., Rinetz J. A connectionist model of development. J. Theoret. Biol. (1991) 152:429–453Crossref, Google Scholar
• Morales L. B., Garduno-Juarez R., Romero D. Applications of simulated annealing to the multiple-minima problem in small peptides. J. Biomolecular Structure Dynam. (1991) 8:721–735Crossref, Google Scholar
• Morgenstern B. Dialign2: Improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics (1999) 15:211–218Crossref, Google Scholar
• Mountain J. L., Cavalli-Sforza L. L. Inference of human evolution through cladistic analysis of nuclear DNA restriction polymorphisms. Proc. National Acad. Sci. USA (1994) 91:6515–6519Crossref, Google Scholar
• Muckstein U., Hofacker I. L., Stadler P. F. Stochastic pairwise alignments. Bioinformatics (2002) 18(2):S153–S160Crossref, Google Scholar
• Nature Double helix at 50. Nature (2003) 422:6934Google Scholar
• Needleman S. B., Wunsch C. D. A general method applicable to the search for similarities in amino acid sequence of two proteins. J. Molecular Biol. (1970) 48:443–453Crossref, Google Scholar
• Nemethy G., Scheraga H. A. Theoretical determination of sterically allowed conformations of a polypeptide chain by a computer method. Biopolymers (1965) 3:155–184Crossref, Google Scholar
• Notredame C., Higgins D., Heringa J. T-Coffee: A novel method for multiple sequence alignments. J. Molecular Biol. (2000) 302:205–217Crossref, Google Scholar
• Park B. H., Levitt M. The complexity and accuracy of discrete state models of protein structure. J. Molecular Biol. (1995) 249(2):493–507Crossref, Google Scholar
• Peitsch M. C. ProMod and Swiss-Model: Internet-based tools for automated comparative protein modeling. Biochem. Soc. Trans. (1996) 24:274–279Crossref, Google Scholar
• Pevzner P. A.Computational Molecular Biology, an Algorithmic Approach (2000) (MIT Press, Cambridge, MA) Crossref, Google Scholar
• Pieper U., Eswar N., Ilyin V. A., Stuart A., Sali A. ModBase, a database of annotated comparative protein structure models. Nucleic Acids Res. (2002) 30:255–259Crossref, Google Scholar
• Proteins: Structure, Function, and GeneticsProteins (1997) 29(Supplement 1):1–230Google Scholar
• Ramachandran G. N., Sasisekharan V. Conformation of polypeptides and proteins. Adv. Protein Chem. (1968) 23:283–438Crossref, Google Scholar
• Rannala B., Yang Z. Probability distribution of molecular evolutionary trees: A new method of phylogenetic inference. J. Molecular Evol. (1996) 43:304–311Crossref, Google Scholar
• Richards F. M. The protein folding problem. Sci. Amer. (1991) 264(1):54–63Crossref, Google Scholar
• Saitou N., Nei M. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biol. Evol. (1987) 4(4):406–425Google Scholar
• Schlick T., Lipkowitz K. B., Boyd D. B. Optimization methods in computational chemistry. Reviews in Computational Chemistry (1992) III(VCH Publishers, New York) 1–71Crossref, Google Scholar
• Schmulevich I., Dougherty E., Kim S., Zhang W. Probabilistic Boolean networks: A rule-based uncertainty model for gene regulatory networks. Bioinformatics (2002) 18:261–274Crossref, Google Scholar
• Schröder E. Vier combinatorische Probleme. Z. Math. Phys. (1870) 15:361–376Google Scholar
• Science Bulding on the DNA revolution. Science (2003) 300:5617Google Scholar
• Shannon C. E. A mathematical theory of communication. Bell System Tech. J. (1948) 27:379–423623656Crossref, Google Scholar
• Smith T. F., Waterman M. S. Identification of common molecular subsequences. J. Molecular Biol. (1981) 147:195–197Crossref, Google Scholar
• Snow M. E. Powerful simulated annealing algorithm locates global minima of protein folding potentials from multiple starting conformations. J. Comput. Chem. (1992) 13:579–584Crossref, Google Scholar
• Stanley R.Enumerative Combinatorics (1996) I2nd ed.(Cambridge University Press, Cambridge, U.K.) Google Scholar
• Swofford D. L. PAUP. (2001) . Phylogenetic analysis using parsimony, V4.0. Sinauer Associates, Boston, MAGoogle Scholar
• Thompson J. D., Higgins D. G., Gibson T. J. CLUSTAL W: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice. Nucleic Acids Res. (1994) 22:4673–4680Crossref, Google Scholar
• Tozeren A., Byers S. W.New Biology for Engineers and Computer Scientists (2003) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Unger R., Moult J. Genetic algorithms for protein folding simulations. J. Molecular Biol. (1993) 231:75–81Crossref, Google Scholar
• Venter J. C., et al. The sequence of the human genome. Science (2001) 29:1304–1351Crossref, Google Scholar
• Wang L. S., Jansen R., Moret B., Raubeson L., Warnow T. Fast phylogenetic methods for genome rearrangement evolution: An empirical study. Proc. 5th Pacific Sympos. Biocomput. (2002) Hawaii:524–535Google Scholar
• Watson J. D., Crick F. H. A structure for deoxyribose nucleic acid. Nature (1953) 171(April):737–738Crossref, Google Scholar
• White K. P., Rifkin S. A., Hurban P., Hogness D. D. Microanalysis of drosphila development during metamorphosis. Science (1999) 286:2179–2184Crossref, Google Scholar
• Winkler H.Verbeitung und Ursache der Parthenogenesis im Pflanzen und Tierreiche (1920) (Verlag Fischer, Jena, Germany) Crossref, Google Scholar
• Xu J., Hagler A. Review: Chemoinformatics and drug discovery. Molecules (2002) 7:566–600Crossref, Google Scholar
• Xu Y., Xu D. Protein threading using PROSPECT: Design and evaluation. Proteins: Structure, Function, Genetics (2000) 40:343–354Crossref, Google Scholar
• Yang Z., Rannala B. Bayesian phylogenetic inference using DNA sequences: A Markov chain Monte Carlo method. Molecular Biol. Evol. (1997) 14:717–724Crossref, Google Scholar
• Zhu J., Liu J. S., Lawrence C. E. Bayesian adaptive sequence alignment algorithms. Bioinformatics (1998) 14:25–39Crossref, Google Scholar