Stefan Kurtz

Mohamed Ibrahim Abouelhoda

Stefano Lonardi

Proceedings of the Handbook of Data Structures and Applications., 2004

e2g: an interactive web-based server for efficiently mapping large EST and cDNA sets to genomic sequences.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2004

Replacing suffix trees with enhanced suffix arrays.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

GenAlyzer: interactive visualization of sequence similarities between entire genomes.

[BibT_eX]

[DOI]

Bioinform., 2004

PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays.

[BibT_eX]

[DOI]

Proceedings of the German Conference on Bioinformatics (GCB 2004), Bielefeld, 2004

2003

Efficient implementation of lazy suffix trees.

[BibT_eX]

[DOI]

Mohamed Ibrahim Abouelhoda

Jens Stoye

Softw. Pract. Exp., 2003

RNA-related tools on the Bielefeld Bioinformatics Server.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2003

An Applications-focused Review of Comparative Genomics Tools: Capabilities, Limitations and Future Challenges.

[BibT_eX]

[DOI]

Briefings Bioinform., 2003

Local Similarity in RNA Secondary Structures.

[BibT_eX]

[DOI]

Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002

Rapid development of nucleic acid diagnostics.

[BibT_eX]

[DOI]

Proc. IEEE, 2002

The Enhanced Suffix Array and Its Applications to Genome Analysis.

[BibT_eX]

[DOI]

Mohamed Ibrahim Abouelhoda

Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Optimal Exact Strring Matching Based on Suffix Arrays.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2002

Efficient multiple genome alignment.

[BibT_eX]

Michael Höhl

Proceedings of the Tenth International Conference on Intelligent Systems for Molecular Biology, 2002

2001

HyPaLib: a database of RNAs and RNA structural elements defined by hybrid patterns.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2001

2000

Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice.

[BibT_eX]

[DOI]

Bernhard Balkenhol

IEEE Trans. Computers, 2000

Computation and Visualization of Degenerate Repeats in Complete Genomes.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, 2000

1999

Reducing the space requirement of suffix trees.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1999

REPuter: fast computation of maximal repeats in complete genomes.

[BibT_eX]

[DOI]

Chris Schleiermacher

Bioinform., 1999

Modifications of the Burrows and Wheeler Data Compression Algorithm.

[BibT_eX]

[DOI]

Bernhard Balkenhol

Yuri M. Shtarkov

Proceedings of the Data Compression Conference, 1999

1997

From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction.

[BibT_eX]

[DOI]

Algorithmica, 1997

Estimating the Probability of Approximate Matches.

[BibT_eX]

[DOI]

Gene Myers

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1995

Fundamental algorithms for a declarative pattern matching system.

[BibT_eX]

[DOI]

PhD thesis, 1995

A Comparison of Imperative and Purely Functional Suffix Tree Constructions.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1995

1994

Suffix Trees in the Functional Programming Paradigm.

[BibT_eX]

[DOI]