4407 Alfred Aho: Pattern matching in strings. In 1105 Book, 325-347. 7805 Russ Altman/John Koza: A programming course in bioinformatics for computer and information science students. Internet 1995, 14p. 15027 Stephen Altschul: Sequence comparison and alignment. In 9589 Bishop/, 137-167. 10802 Eric Anson/Eugene Myers: ReAligner - a program for refining DNA sequence multi-alignments. J. Comp. Biol. 4 (1997), 369-383. V. Bafna/E. Lawler/Pavel Pevzner: Approximation algorithms for multiple sequence alignment. Proc. 5th Annual Symp. Combinatorial Pattern Matching, Springer 1994, 43-53. 9875 Timothy Bailey/Michael Gribskov: Score distributions for simultaneous matching to multiple motifs. J. Comp. Biol. 4 (1997), 45-59. 8202 G. Bell a.o.: Properties of words on four letters from those on two letters with an application to DNA sequences. Adv. Appl. Math. 14 (1993), 348-367. 10801 Gary Benson: Sequence alignment with tandem duplication. J. Comp. Biol. 4 (1997), 351-367. W. Beyer/M. Stein/T. Smith/Stan Ulam: A molecular-sequence metric and evolutionary trees. Math. Biosci. 19 (1974), 9-25. 9589 Martin Bishop/Christopher Rawlings (ed.): DNA and protein sequence analysis. Oxford UP 1997. 1105 Ronald Book (ed.): Formal language theory. Academic Press 1980. M. Borodovsky/A. Mironov/Pavel Pevzner: Linguistics of nucleotide sequences I-II. J. Biom. Str. Dyn. 6 (1989), 1013-1040. J. Bowie/R. Luthy/D. Eisenberg: A method to identify protein sequences that fold into a known three-dimensional structure. Science 12 July 1991, 164-170. 4754 David Bradley/Richard Bradley: Application of sequence comparison to the study of bird songs. 1064 Sankoff/Kruskal, 189-209. 4516 Giulia Candiani: I cartografi della doppia elica. Tempo Medico 9 Dicembre 1992, 3. H. Carrillo/D. Lipman: The multiple sequence alignment problem in biology. SIAM J. Appl. Math. 48 (1988), 1073-1082. Present a branch-and-bound approach. S. Chan/A. Wong/D. Chiu: A survey of multiple sequence comparison methods. Bull. Math. Biol. 54 (1992), 563-598. K. Chao/R. Hardison/W. Miller: Recent developments in linear-space alignment methods. A mini-survey. J. Comput. Biol. 1 (1994), 271-291. "A naive implementation of a sequence alignment algorithm requires space quadratic in the sequence length. This has been a major obstacle to the routine use of sequence alignment programs. Linear space alignment techniques have contributed greatly to the acceptance of alignment software by biologists." (8078 Vingron/) 4758 James Coggins: Dissimilarity measures for clustering strings. 1064 Sankoff/Kruskal, 311-321. Maxime Crochemore/Wojciech Rytter: Text algorithms. Oxford UP 1994, 420p. 0-19-508609-0. Pds. 75. 11573 Maxime Crochemore/A. Henaut: Reseau informatique et genomes. Internet 1997, 102p. 4368 R. Darling/Michael Waterman: Matching rectangles in d dimensions: Algorithms and laws of large numbers. Adv. Math. 55 (1985), 1-12. [4383] R. Doolittle (ed.): Molecular evolution. Computer analysis of protein and nucleic acid sequences. Meth. Enzymol. 183 (1990). B. Durbin/S. Eddy/A. Krogh/G. Mitchison: Biological sequence analysis - probabilistic models of proteins and nucleic acids. Cambridge UP 1998. D. Eppstein/Z. Galil/R. Giancarlo/G. Italiano: Sparse dynamic programming I. Linear cost functions. J. ACM 39 (1992), 519-545. D. Eppstein/Z. Galil/R. Giancarlo/G. Italiano: Sparse dynamic programming II. Concave, convex cost functions. J. ACM 39 (1992), 546-567. 4750 Bruce Erickson/Peter Sellers: Recognition of patterns in genetic sequences. 1064 Sankoff/Kruskal, 55-91. 23543 Guillaume Fertin/.../Stephane Vialette: Combinatorics of genome rearrangements. MIT Press 2009, 290p. Eur 34. 3648 David Finkel: HIV-1 ancestry - primordial expansions of RRE and RRE related sequences. J. Theor. Biol. 154 (1992), 285-302. M. Fredman: Algorithms for computing evolutionary similarity measures with length independent gap penalties. Bull. Math. Biol. 46 (1984), 553-566. 14427 Robert Giegerich: A systematic approach to dynamic programming in bioinformatics. Internet ca. 2000, 14p. W. Goad/M. Kanehisha: Pattern recognition in nucleic acid sequences I. A general method for finding local homologies and symmetries. Nucl. Acids Res. 10 (1982), 247-263. O. Gotoh: Alignment of three biological sequences with an efficient traceback procedure. J. Theor. Biol. 121 (1986), 327-337. 19042 Osamu Gotoh: Multiple sequence alignment - algorithms and applications. Adv. Biophys. 36 (1999), 159-206. Michael Gribskov/John Devereux (ed.): Sequence analysis primer. Oxford UP 1991, 300p. 0-19-509874-9. Pds. 30. 4463 L. Guibas/Andrew Odlyzko: Long repetitive patterns in random sequences. Z. Wtheorie 53 (1980), 241-262. 8183 Sandeep Gupta/John Kececioglu/Alejandro Schaeffer: Making the shortest-path approach to sum-of-pairs multiple sequence alignment more space efficient in practice. Internet, ca. 1994, 22p. Sandeep Gupta/John Kececioglu/Alejandro Schaeffer: Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. J. Comp. Biol. 2 (1995), 459-472. D. Gusfield: Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol. 55 (1993), 141-154. D. Gusfield/K. Balasubramanian/D. Naor: Parametric optimization of sequence alignment. Algorithmica 12/4-5 (1994), 312-326. Dan Gusfield: Algorithms on strings, trees and sequences. Cambridge UP 1997, 530p. 0-521-58519-8. $60. 18747 Steven Henikoff/Jorja Henikoff: Amino acid substitution matrices from protein blocks. Proc. Nat. Ac. Sci. USA 89 (1992), 10915-10919. 4759 Daniel Hirschberg: Recent results on the complexity of common-subsequence problems. In 1064 Sankoff/, 325-330. 4753 Melvyn Hunt/Matthew Lennig/Paul Mermelstein: Use of dynamic programming in a syllable-based continuous speech recognition system. In 1064 Sankoff/, 163-187. 8175 Mudita Jain/Eugene Myers: A note on scoring clones given a probe ordering. Internet, ca. 1992, 8p. R. Jue/N. Woodbury/R. Doolittle: Sequence homologies among E. coli ribosomal proteins. Evidence for evolutionary related groupings and internal duplications. J. Mol. Evol. 15 (1980), 129-148. M. Kanehisha/W. Goad: Pattern recognition in nucleic acid sequences II. An efficient method for finding locally stable secondary structures. Nucl. Acids Res. 10 (1982), 265-277. 8190 Sampath Kannan/Eugene Myers: An algorithm for locating non-overlapping regions of maximum alignment score. Internet, ca. 1994, 15p. 4464 Samuel Karlin a.o.: New approaches for computer analysis of nucleic acid sequences. Proc. Nat. Ac. Sci. USA 80 (1983), 5660-5664. 7958 Peter Karp/Suzanne Paley: Integrated access to metabolic and genomic data. J. Comp. Biol. 3 (1996), 191-212. John Kececioglu: The maximum weight trace problem in multiple sequence alignment. Proc. 4th Symp. Comb. Pattern Matching, Springer 1993, 106-119. 8186 James Knight/Eugene Myers: Approximate regular expression pattern matching with concave gap penalties. Internet, ca. 1992, 30p. 2582 Joseph Kruskal: An overview of sequence comparison. 1064 Sankoff/Kruskal, 1-44. 4752 Joseph Kruskal/Mark Liberman: The symmetric time-warping problem: from continuous to discrete. 1064 Sankoff/Kruskal, 125-161. 4757 Joseph Kruskal/David Sankoff: An anthology of algorithms and concepts for sequence comparison. 1064 Sankoff/Kruskal, 265-310. M. Kunze/G. Thierrin: Maximal common subsequences of pairs of strings. Congressus Numerantium 34 (1982), 299-311. 18748 Stefan Kurtz: Foundations of sequence analysis. Lecture Notes Bielefeld 2002, 77p. 8176 Gad Landau/Eugene Myers/Jeanette Schmidt: Incremental string comparison. Internet, ca. 1994, 28p. 12070 Eric Lander/Robert Langridge/Damian Saccocio: Mapping and interpreting biological information. Comm. ACM 34/11 (1991), 33-39. V. Levenshtein: Binary codes capable of correcting deletions, insertions, and reversals. Dokl. AN 163/4 (1965), 845-848. (Russian) D. Lipman/S. Altschul/John Kececioglu: A tool for multiple sequence alignment. Proc. Nat. Ac. Sci. 86 (1989), 4412-4415. 4761 William Masek/Michael Paterson: How to compute string-edit distances quickly. In 1064 Sankoff/Kruskal, 337-349. 4491 G. Mani: Correlations between the coding and non-coding region in DNA. J. Theor. Biol. 158 (1992), 429-445. 4490 G. Mani: Long-range double correlations in DNA and the coding regions. J. Theor. Biol. 158 (1992), 447-464. 8085 Heinz Mevissen/Martin Vingron: Quantifying the local reliability of a sequence alignment. Internet, ca. 1995, 17p. D. Mills: A new algorithm to determine the Levenshtein distance between two strings. Conf. Sequence Comparison Montreal, April 1979. M. Murata/J. Richardson/J. Sussman: Simultaneous comparisons of three protein sequences. Proc. Nat. Ac. Sci. 82 (1985), 3037-3077 (?). 8179 Eugene Myers: Approximately matching context-free languages. Internet, ca. 1989, 9p. 8172 Eugene Myers: An overview of sequence comparison algorithms in molecular biology. Dept. CS Univ. Arizona Tucson, TR 29 (1991). 8174 Eugene Myers: Approximate matching of network expressions with spacers. Internet, ca. 1993, 25p. Eugene Myers (ed.): ... Algorithmica 13/1-2 (1995). Special issue devoted to computational molecular biology. 8187 Eugene Myers/Mudita Jain: Going against the grain. Internet, ca. 1995, 11p. 8185 Eugene Myers/Webb Miller: Chaining multiple-alignment fragments in sub-quadratic time. Proc. 6th Annual ACM-SIAM Symp. Discr. Algorithms 1995, 38-47. 8173 Eugene Myers/Sanford Selznick/Zheng Zhang/Webb Miller: Progressive multiple alignment with constraints. Internet, ca. 1995, 22p. [= 10200 Eugene Myers/Sanford Selznick/Zheng Zhang/Webb Miller: Progressive multiple alignment with constraints. J. Comp. Biol. 3 (1996), 563-572.] 15016 Cedric Notredame: Utilisation des algorithmes genetiques pour l'analyse de sequences biologiques. Thesis 1998, ca. 70p. 4366 W. Pearson/D. Lipman: Improved tools for biological sequence metrics. Proc. Nat. Ac. USA 85 (1988), 2444-2448. [4383] Pavel Pevzner: Multiple alignment, communication cost, and graph matching. SIAM J. Appl. Math. 52 (1992), 1763-1779. 8199 Pavel Pevzner/Michael Waterman: Generalized sequence alignment and duality. Adv. Appl. Math. 14 (1993), 139-171. Pavel Pevzner/Michael Waterman: Open combinatorial problems in computational molecular biology. Proc. 3d Israel Symp. Theory Comput. Systems, Tel Aviv 1995. IEEE Computer Society Press 1995, ... 7956 Soren Kamaric Riis/Anders Krogh: Improving prediction of protein secondary structure using structured neural networks and multiple sequence alignments. J. Comp. Biol. 3 (1996), 163-183. 16391 Lior Pachter/Bernd Sturmfels: The geometry of statistical models for biological sequences. Internet 2003, 14p. 18960 Soumya Raychaudhuri: Computational text analysis for functional genomics and bioinformatics. Oxford UP 2006, 300p. Eur 57. 10637 Eric Rivals: Algorithmes de compression et applications a' l'analyse de sequences genetiques. These Docteur Univ. Lille 1996. 4751 David Sankoff/Joseph Kruskal/Sylvie Mainville/Robert Cedergren: Fast algorithms to determine RNA secondary structures containing multiple loops. In 1064 Sankoff/Kruskal, 93-120. 3961 Michael Schoeniger/Michael Waterman: A local algorithm for DNA sequence alignment with inversions. Bull. Math. Biol. 54 (1992), 521-536. [4383] 4511 P. Sellers: An algorithm for the distance between two finite sequences. J. of Comb. Theory (A) 16 (1974), 253-258. 4370 Peter Sellers: On the theory and computation of evolutionary distances. SIAM J. appl. Math. 26 (1974), 787-793. [4383] 10803 Tetsuo Shibuya/Hiroshi Imai: New flexible approaches for multiple sequence alignment. J. Comp. Biol. 4 (1997), 385-413. E. Sobel/R. Martinez: A multiple sequence alignment program. Nucl. Acids Res. 14 (1986), 363-374. Terry Speed/Michael Waterman (ed.): Genetic mapping and DNA sequencing. Springer 1996, 220p. 3-540-94803-1. DM 94. 7845 Fengzhu Sun/Norman Arnheim/Michael Waterman: Whole genome amplification of single cells - mathematical analysis of PEP and tagged PCR. Nucleid Acids Res. (ca. 1995), ... 8101 William Taylor: A non-local gap-penalty for profile alignment. Bull. Math. Biol. 58 (1996), 1-18. 1021 Edward Trifonov/Volker Brendel: Gnomic. VCH 1987. A dictionary of genetic codes. 8086 Martin Vingron: Near-optimal sequence alignment. Internet, ca. 1995, 19p. 8078 Martin Vingron/Hans Peter Lenhof/Petra Mutzel: Computational molecular biology. Internet 1996, 26p. 8088 Martin Vingron/Michael Waterman: Alignment networks and electrical networks. Internet, ca. 1994, 18p. 8087 Martin Vingron/Michael Waterman: Statistical significance of local alignments with gaps. Internet, ca. 1994, 9p. 4755 Robert Wagner: On the complexity of the extended string-to-string correction problem. In 1064 Sankoff/, 215-235. 4760 Robert Wagner: Formal-language error correction. In 1064 Sankoff/, 331-336. L. Wang/T. Jiang: On the complexity of multiple sequence alignment. J. Comp. Biol. 1 (1994), 337-348. Michael Waterman: General methods of sequence comparison. Bull. Math. Biol. 46 (1984), 473-500. 4371 Michael Waterman: Dynamic programming algorithms for picture comparison. Adv. appl. Math. 6 (1985), 129-134. [4383] 4574 Michael Waterman (ed.): Mathematical methods of DNA sequences. CRC 1989. 4575 Michael Waterman: Sequence alignments. In 4574 Waterman, 53-92. 4576 Michael Waterman: Consensus patterns in sequences. In 4574 Waterman, 93-115. Michael Waterman: Parametric and ensemble sequence alignment algorithms. Bull. Math. Biol. 56 (1994), 743-767. 9733 Michael Waterman: Introduction to computational biology. Maps, sequences and genomes. Chapman & Hall 1996, 450p. 0-41299-391-0. DM 95. Michael Waterman/M. Eggert/Eric Lander: Parametric sequence comparison. Proc. Nat. Ac. Sci. 89 (1992), 6090-6093. 4367 Michael Waterman/T. Smith/W. Beyer: Some biological sequence metrics. Adv. Math. 20 (1976), 367-287. [4383] 848 W. Wilbur/D. Lipman: The context dependent comparison of biological sequences. SIAM J. appl. Math. 44 (1984), 557-567. [4383] Z. Zhang/B. Raghavachari/R. Hardison/W. Miller: Chaining multiple-alignment blocks. J. Comp. Biol. 1 (1994), 217-226. 11572 ZZ: Projet GREG 1995-1996. Motifs dans les sequences. Internet 1996, 56p.