Orthopädische Navigation auf der Basis von Kernspin-Bilddatensätzen (2007)
Computergestütze Systeme für orthopädische Operationen verwenden präoperativ erstellte 3D-Daten zur Planung und Unterstützung der chirurgischen Eingriffe. Die dominierende Bildgebungsmodalität...
Local approximate 3D matching of proteins in viral (2004)
Stefan Burkhardt, Kimmo Fredriksson, Tuomas Ojamies, Janne Ravantti, Esko Ukkonen
Experimental structure analysis of biological molecules (e.g, proteins) or macromolecular complexes (e.g, viruses) can be used to generate three-dimensional density maps of these entities. Such a...
Filter algorithms for approximate string matching (2004)
In this work we present new results and methods for approximate string matching with filter algorithms. We begin with the presentation of QUASAR, our efficient implementation of an improved version...
Erscheinungsjahr an der Haupttitelstelle: 2003
Better Filtering with Gapped q-Grams (2003)
A popular and well-studied class of filters for approximate string matching compares substrings of length q, the q-grams, in the pattern and the text to identify text areas that contain potential...
Fast Lightweight Suffix Array Construction and Checking (2003)
We describe an algorithm that, for any v 2 [2, n], constructs the suffix array of a string of length n in O(vn + n log n) time using O(v + n/ v) space in addition to the input (the string) and the...
Better Filtering with Gapped q-Grams (2003)
Burkhardt,Stefan, Kärkkäinen,Juha
A popular and well-studied class of filters for approximate string matching compares substrings of length $q$, \emph{the $q$-grams}, in the pattern and the text to identify text areas that contain...
Fast Lightweight Suffix Array Construction and Checking (2003)
Burkhardt,Stefan, Kärkkäinen,Juha
We describe an algorithm that, for any $v\in[2,n]$, constructs the suffix array of a string of length $n$ in $\Oh{vn + n \log n}$ time using $\Oh{v+n/\sqrt{v}}$ space in addition to the input (the...
Better Filtering with Gapped q-Grams (2003)
Burkhardt, Stefan, Kärkkäinen, Juha
A popular and well-studied class of filters for approximate string matching compares substrings of length $q$, \emph{the $q$-grams}, in the pattern and the text to identify text areas that contain...
Fast Lightweight Suffix Array Construction and Checking (2003)
Burkhardt, Stefan, Kärkkäinen, Juha, Baeza-Yates, R., Chávez, E., Crochemore, M.
We describe an algorithm that, for any $v\in[2,n]$, constructs the suffix array of a string of length $n$ in $\Oh{vn + n \log n}$ time using $\Oh{v+n/\sqrt{v}}$ space in addition to the input (the...
One-gapped q-Gram Filters for Levenshtein Distance (2002)
We have recently shown that q-gram filters based on gapped q-grams instead of the usual contiguous q-grams can provide orders of magnitude faster and/or more efficient filtering for the Hamming...
One-Gapped q-Gram Filters for Levenshtein Distance (2002)
We have recently shown that q-gram lters based on gapped q-grams instead of the usual contiguous q-grams can provide orders of magnitude faster and/or more ecient ltering for the Hamming distance. In...
Better Filtering with Gapped q-Grams (2002)
The q-gram filter is a popular filtering method for approximate string matching. It compares substrings of length q (the q-grams) in the pattern and the text to identify the text areas that might...
Filter algorithms for approximate string matching (2002)
In this work we present new results and methods for approximate string matching with filter algorithms. We begin with the presentation of QUASAR, our efficient implementation of an improved version...
One-Gapped q-Gram Filters for Levenshtein Distance (2002)
Burkhardt,Stefan, Kärkkäinen,Juha
We have recently shown that $q$-gram filters based on gapped $q$-grams instead of the usual contiguous $q$-grams can provide orders of magnitude faster and/or more efficient filtering for the Hamming...
One-Gapped q-Gram Filters for Levenshtein Distance (2002)
Burkhardt, Stefan, Kärkkäinen, Juha, Apostolico, Alberto, Takeda, Masayuki
We have recently shown that $q$-gram filters based on gapped $q$-grams instead of the usual contiguous $q$-grams can provide orders of magnitude faster and/or more efficient filtering for the Hamming...
Filter algorithms for approximate string matching / (2002)
Saarbrücken, University, Diss., 2002.
Better Filtering with Gapped q-Grams Stefan Burkhardt (2001)
The q-gram lter is a popular ltering method for approximate string matching. It compares substrings of length q (the q-grams) in the pattern and the text to identify the text areas that might contain...
Segmentierung des Knochens aus T1- und PD-gewichteten Kernspinbildern vom Kopf (2001)
Für viele Anwendung, beispielsweise bei der Simulation biomechanischer Eigenschaften des Kopfes oder bei der Lokalisation von Hirnaktivität aus EEG/MEG-Daten, werden genaue, individuelle Modelle...
Wolters, Carsten Hermann, Reitzinger, S., Basermann, A., Burkhardt, Stefan, Hartmann, Ulrich, Kruggel, F., ...
q-gram Based Database Searching Using a Suffix Array (QUASAR) (1999)
Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-peter Lenhof, Martin Vingron
With the increasing amount of DNA sequence information deposited in public databases, searching for similarity to a query sequence has become a basic operation in molecular biology. But even today's...
Flockerzi, Aline, Burkhardt, Stefan, Schempp, Werner, Meese, Eckart, Mayer, Jens
The human genome harbors many distinct families of human endogenous retroviruses (HERVs) that stem from exogenous retroviruses that infected the germ line millions of years ago. Many HERV families...
Flockerzi, Aline, Burkhardt, Stefan, Schempp, Werner, Meese, Eckart, Mayer, Jens
The human genome harbors many distinct families of human endogenous retroviruses (HERVs) that stem from exogenous retroviruses that infected the germ line millions of years ago. Many HERV families...