Enhanced Suffix Arrays and Applications

[1]  Enno Ohlebusch,et al.  Replacing suffix trees with enhanced suffix arrays , 2004, J. Discrete Algorithms.

[2]  Peter Sanders,et al.  Simple Linear Work Suffix Array Construction , 2003, ICALP.

[3]  Srinivas Aluru,et al.  Space efficient linear time construction of suffix arrays , 2003, J. Discrete Algorithms.

[4]  Dong Kyue Kim,et al.  Linear-Time Construction of Suffix Arrays , 2003, CPM.

[5]  Enno Ohlebusch,et al.  An Applications-focused Review of Comparative Genomics Tools: Capabilities, Limitations and Future Challenges , 2003, Briefings Bioinform..

[6]  Enno Ohlebusch,et al.  The Enhanced Suffix Array and Its Applications to Genome Analysis , 2002, WABI.

[7]  Enno Ohlebusch,et al.  Efficient multiple genome alignment , 2002, ISMB.

[8]  Kunihiko Sadakane,et al.  Succinct representations of lcp information and improvements in the compressed suffix arrays , 2002, SODA '02.

[9]  J. Stoye,et al.  REPuter: the manifold applications of repeat analysis on a genomic scale. , 2001, Nucleic acids research.

[10]  Hiroki Arimura,et al.  Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications , 2001, CPM.

[11]  J. V. Moran,et al.  Initial sequencing and analysis of the human genome. , 2001, Nature.

[12]  Burkhard Morgenstern,et al.  A space-efficient algorithm for aligning large genomic sequences , 2000, Bioinform..

[13]  Roberto Grossi,et al.  Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) , 2000, STOC '00.

[14]  Michael A. Bender,et al.  The LCA Problem Revisited , 2000, LATIN.

[15]  R. Gibbs,et al.  PipMaker--a web server for aligning two genomic DNA sequences. , 2000, Genome research.

[16]  Stefan Kurtz,et al.  Reducing the space requirement of suffix trees , 1999, Softw. Pract. Exp..

[17]  Gregory Kucherov,et al.  Finding maximal repetitions in a word in linear time , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[18]  J. Mesirov,et al.  Computational biology , 1999, Computing in Science & Engineering.

[19]  Jens Stoye,et al.  Simple and flexible detection of contiguous repeats using a suffix tree , 1998, Theor. Comput. Sci..

[20]  Z. Galil,et al.  Pattern matching algorithms , 1997 .

[21]  Eugene L. Lawler,et al.  Sublinear approximate string matching and biological applications , 1994, Algorithmica.

[22]  Eugene W. Myers,et al.  Suffix arrays: a new method for on-line string searches , 1993, SODA '90.

[23]  Wojciech Szpankowski,et al.  Self-Alignments in Words and Their Applications , 1992, J. Algorithms.

[24]  Gaston H. Gonnet,et al.  New Indices for Text: Pat Trees and Pat Arrays , 1992, Information Retrieval: Data Structures & Algorithms.

[25]  M. Lefranc,et al.  Rearrangement of two distinct T-cell γ-chain variable-region genes in human DNA , 1986, Nature.

[26]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[27]  S. B. Needleman,et al.  A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[28]  Nicholas L. Bray,et al.  AVID: A global alignment program. , 2003, Genome research.

[29]  Chuong B. Do,et al.  Alignment of Genomic DNA LAGAN and Multi-LAGAN : Efficient Tools for Large-Scale Multiple , 2003 .

[30]  E. Eichler,et al.  The Pathological Consequences and Evolutionary Implications of Recent Human Genomic Duplications , 2000 .

[31]  S. Salzberg,et al.  Alignment of whole genomes. , 1999, Nucleic acids research.

[32]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[33]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[34]  Alberto Apostolico,et al.  The Myriad Virtues of Subword Trees , 1985 .