6 citations · 12 across the 6 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2016
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…
cs.DS2013
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…
cs.DS2010★ 3 cited
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…