According to our database1, Tobias Marschall authored at least 37 papers between 2006 and 2019.
Legend:Book In proceedings Article PhD thesis Other
12 Grand Challenges in Single-Cell Data Science.
PeerJ PrePrints, 2019
Bit-parallel sequence-to-graph alignment.
Fully-sensitive seed finding in sequence graphs using a hybrid index.
Strand-seq enables reliable separation of long reads by chromosome via expectation maximization.
A graph-based approach to diploid genome assembly.
Chromatyping: Reconstructing Nucleosome Profiles from NOMe Sequencing Data.
Proceedings of the Research in Computational Molecular Biology, 2018
Genotyping inversions and tandem duplications.
A Guided Tour to Computational Haplotyping.
Proceedings of the Unveiling Dynamics and Complexity, 2017
Eliminating Blind Spots in Genetic Variant Discovery.
ERCIM News, 2016
Representing Pattern Matching Algorithms by Polynomial-Size Automata.
PWHATSHAP: efficient haplotyping for future generation sequencing.
BMC Bioinformatics, 2016
Detecting horizontal gene transfer by mapping sequencing reads across species boundaries.
Read-based phasing of related individuals.
Next generation cluster editing.
PeerJ PrePrints, 2015
WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads.
Journal of Computational Biology, 2015
Genome sequence analysis with MonetDB - A case study on Ebola virus diversity.
Repeat- and error-aware comparison of deletions.
Viral Quasispecies Assembly via Maximal Clique Enumeration.
PLoS Computational Biology, 2014
WhatsHap: Haplotype Assembly for Future-Generation Sequencing Reads.
Proceedings of the Research in Computational Molecular Biology, 2014
High-Performance Haplotype Assembly.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2014
Mapping proteins in the presence of paralogs using units of coevolution.
BMC Bioinformatics, 2013
Discovering motifs that induce sequencing errors.
BMC Bioinformatics, 2013
MATE-CLEVER: Mendelian-inheritance-aware discovery and genotyping of midsize and long indels.
Probabilistic Arithmetic Automata and Their Applications.
IEEE/ACM Trans. Comput. Biology Bioinform., 2012
CLEVER: clique-enumerating variant finder.
Solving the Minimum String Cover Problem.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012
Algorithms and statistical methods for exact motif discovery.
PhD thesis, 2011
Construction of minimal deterministic finite automata from biological motifs.
Theor. Comput. Sci., 2011
An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms.
Exact Analysis of Pattern Matching Algorithms with Probabilistic Arithmetic Automata
Construction of minimal DFAs from biological motifs
Speeding Up Exact Motif Discovery by Bounding the Expected Clump Size.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010
Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata.
Proceedings of the Language and Automata Theory and Applications, 2010
Efficient exact motif discovery.
Modeling evolutionary fitness for DNA motif discovery.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008
Automatic Detection of Song Changes in Music Mixes Using Stochastic Models.
Proceedings of the 18th International Conference on Pattern Recognition (ICPR 2006), 2006