default search action
Tobias Marschall
Person information
- affiliation: Heinrich Heine University Düsseldorf, Germany
- affiliation: Saarland University, Center for Bioinformatics, Saarbrücken, Germany
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j26]Konstantinn Bonnet, Tobias Marschall, Daniel Doerr:
Constructing founder sets under allelic and non-allelic homologous recombination. Algorithms Mol. Biol. 18(1): 15 (2023) - [j25]Konstantinn Bonnet, Tobias Marschall, Daniel Doerr:
Correction: Constructing founder sets under allelic and non-allelic homologous recombination. Algorithms Mol. Biol. 18(1): 20 (2023) - 2022
- [j24]Fawaz Dabbaghie
, Jana Ebler, Tobias Marschall
BubbleGun: enumerating bubbles and superbubbles in genome graphs. Bioinform. 38(17): 4217-4219 (2022) - [c13]Konstantinn Bonnet, Tobias Marschall
Constructing Founder Sets Under Allelic and Non-Allelic Homologous Recombination. WABI 2022: 6:1-6:23 - 2021
- [j23]Mikko Rautiainen
MBG: Minimizer-based sparse de Bruijn Graph construction. Bioinform. 37(16): 2476-2478 (2021) - [j22]Christina Gros
ASHLEYS: automated quality control for single-cell Strand-seq data. Bioinform. 37(19): 3356-3357 (2021) - 2020
- [j21]Shounak Chakraborty, Stefan Canzar
Chromatyping: Reconstructing Nucleosome Profiles from NOMe Sequencing Data. J. Comput. Biol. 27(3): 330-341 (2020)
2010 – 2019
- 2019
- [j20]Ali Ghaffaari, Tobias Marschall:
Fully-sensitive seed finding in sequence graphs using a hybrid index. Bioinform. 35(14): i81-i89 (2019) - [j19]Mikko Rautiainen
Bit-parallel sequence-to-graph alignment. Bioinform. 35(19): 3599-3607 (2019) - [i8]David Laehnemann
12 Grand Challenges in Single-Cell Data Science. PeerJ Prepr. 7: e27885 (2019) - 2018
- [j18]Shilpa Garg, Mikko Rautiainen, Adam M. Novak
A graph-based approach to diploid genome assembly. Bioinform. 34(13): i105-i114 (2018) - [j17]Maryam Ghareghani, David Porubsky
Strand-seq enables reliable separation of long reads by chromosome via expectation maximization. Bioinform. 34(13): i115-i123 (2018) - [c12]Shounak Chakraborty, Stefan Canzar
Chromatyping: Reconstructing Nucleosome Profiles from NOMe Sequencing Data. RECOMB 2018: 21-36 - 2017
- [j16]Jana Ebler, Alexander Schönhuth
Genotyping inversions and tandem duplications. Bioinform. 33(24): 4015-4023 (2017) - [c11]Gunnar W. Klau, Tobias Marschall:
A Guided Tour to Computational Haplotyping. CiE 2017: 50-63 - 2016
- [j15]Shilpa Garg, Marcel Martin, Tobias Marschall:
Read-based phasing of related individuals. Bioinform. 32(12): 234-242 (2016) - [j14]Kathrin Trappe, Tobias Marschall, Bernhard Y. Renard
Detecting horizontal gene transfer by mapping sequencing reads across species boundaries. Bioinform. 32(17): 595-604 (2016) - [j13]Andrea Bracciali, Marco Aldinucci
PWHATSHAP: efficient haplotyping for future generation sequencing. BMC Bioinform. 17(S-11): 342 (2016) - [i7]Tobias Marschall, Noemi E. Passing:
Representing Pattern Matching Algorithms by Polynomial-Size Automata. CoRR abs/1607.00138 (2016) - [i6]Alexander Schönhuth, Tobias Marschall:
Eliminating Blind Spots in Genetic Variant Discovery. ERCIM News 2016(104) (2016) - 2015
- [j12]Roland Wittler, Tobias Marschall
Repeat- and error-aware comparison of deletions. Bioinform. 31(18): 2947-2954 (2015) - [j11]Robin Cijvat, Stefan Manegold, Martin L. Kersten, Gunnar W. Klau, Alexander Schönhuth
Genome sequence analysis with MonetDB - A case study on Ebola virus diversity. Datenbank-Spektrum 15(3): 185-191 (2015) - [j10]Murray Patterson
WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads. J. Comput. Biol. 22(6): 498-509 (2015) - [c10]Robin Cijvat, Stefan Manegold, Martin L. Kersten, Gunnar W. Klau, Alexander Schönhuth, Tobias Marschall, Ying Zhang:
Genome sequence analysis with monetdb: a case study on ebola virus diversity. BTW Workshops 2015: 143-150 - [i5]Thomas Bellitto, Tobias Marschall, Alexander Schönhuth, Gunnar W. Klau
Next generation cluster editing. PeerJ Prepr. 3: e1301 (2015) - 2014
- [j9]Armin Töpfer, Tobias Marschall
Viral Quasispecies Assembly via Maximal Clique Enumeration. PLoS Comput. Biol. 10(3) (2014) - [c9]Marco Aldinucci
High-Performance Haplotype Assembly. CIBB 2014: 245-258 - [c8]Murray Patterson, Tobias Marschall, Nadia Pisanti, Leo van Iersel, Leen Stougie, Gunnar W. Klau
WhatsHap: Haplotype Assembly for Future-Generation Sequencing Reads. RECOMB 2014: 237-249 - [c7]Armin Töpfer, Tobias Marschall, Rowena A. Bull
Viral Quasispecies Assembly via Maximal Clique Enumeration. RECOMB 2014: 309-310 - 2013
- [j8]Tobias Marschall
MATE-CLEVER: Mendelian-inheritance-aware discovery and genotyping of midsize and long indels. Bioinform. 29(24): 3143-3150 (2013) - [j7]Mohammed El-Kebir
Mapping proteins in the presence of paralogs using units of coevolution. BMC Bioinform. 14(S-15): S18 (2013) - [j6]Manuel Allhoff, Alexander Schönhuth
Discovering motifs that induce sequencing errors. BMC Bioinform. 14(S-5): S1 (2013) - [i4]Thomas Bellitto, Tobias Marschall, Alexander Schönhuth, Gunnar W. Klau:
Next Generation Cluster Editing. CoRR abs/1310.3353 (2013) - 2012
- [j5]Tobias Marschall
CLEVER: clique-enumerating variant finder. Bioinform. 28(22): 2875-2882 (2012) - [j4]Tobias Marschall
Probabilistic Arithmetic Automata and Their Applications. IEEE ACM Trans. Comput. Biol. Bioinform. 9(6): 1737-1750 (2012) - [c6]Stefan Canzar
Solving the Minimum String Cover Problem. ALENEX 2012: 75-83 - 2011
- [b1]Tobias Marschall:
Algorithms and statistical methods for exact motif discovery. Dortmund University of Technology, 2011 - [j3]Tobias Marschall, Sven Rahmann
An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms. Algorithms 4(4): 285-306 (2011) - [j2]Tobias Marschall:
Construction of minimal deterministic finite automata from biological motifs. Theor. Comput. Sci. 412(8-10): 922-930 (2011) - 2010
- [c5]Tobias Marschall, Sven Rahmann:
Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata. LATA 2010: 439-450 - [c4]Tobias Marschall, Sven Rahmann:
Speeding Up Exact Motif Discovery by Bounding the Expected Clump Size. WABI 2010: 337-349 - [i3]Tobias Marschall:
Construction of minimal DFAs from biological motifs. CoRR abs/1004.1298 (2010) - [i2]Tobias Marschall, Sven Rahmann:
Exact Analysis of Pattern Matching Algorithms with Probabilistic Arithmetic Automata. CoRR abs/1009.6114 (2010) - [i1]Tobias Marschall, Inke Herms, Hans-Michael Kaltenbach, Sven Rahmann:
Probabilistic Arithmetic Automata and their Applications. CoRR abs/1011.5778 (2010)
2000 – 2009
- 2009
- [j1]Tobias Marschall
Efficient exact motif discovery. Bioinform. 25(12) (2009) - [c3]Sven Rahmann
Modeling evolutionary fitness for DNA motif discovery. GECCO 2009: 225-232 - 2008
- [c2]Tobias Marschall, Sven Rahmann:
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics. CPM 2008: 95-106 - 2006
- [c1]Thomas Plötz, Gernot A. Fink
Automatic Detection of Song Changes in Music Mixes Using Stochastic Models. ICPR (3) 2006: 665-668
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: