6 citations · 12 across the 6 of their papers we have counts for
7 papers
Representing Pattern Matching Algorithms by Polynomial-Size Automata
Tobias Marschall, Noemi E. Passing
Pattern matching algorithms to find exact occurrences of a pattern in a text have been analyzed extensively with respect to asymptotic best, worst, and average…
Next Generation Cluster Editing
Thomas Bellitto, Tobias Marschall, Alexander Schönhuth +1
This work aims at improving the quality of structural variant prediction from the mapped reads of a sequenced genome. We suggest a new model based on cluster editing in weighted gr…
Sensitive Long-Indel-Aware Alignment of Sequencing Reads
Tobias Marschall, Alexander Schönhuth
The tremdendous advances in high-throughput sequencing technologies have made population-scale sequencing as performed in the 1000 Genomes project and the Genome of the Netherlands…
CLEVER: Clique-Enumerating Variant Finder
Tobias Marschall, Ivan Costa, Stefan Canzar +4
Next-generation sequencing techniques have facilitated a large scale analysis of human genetic variation. Despite the advances in sequencing speeds, the computational discovery of…
Probabilistic Arithmetic Automata and their Applications
Tobias Marschall, Inke Herms, Hans-Michael Kaltenbach +1
We present probabilistic arithmetic automata (PAAs), a general model to describe chains of operations whose operands depend on chance, along with two different algorithms to exactl…
Exact Analysis of Pattern Matching Algorithms with Probabilistic Arithmetic Automata
Tobias Marschall, Sven Rahmann
We propose a framework for the exact probabilistic analysis of window-based pattern matching algorithms, such as Boyer-Moore, Horspool, Backward DAWG Matching, Backward Oracle Matc…