default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChris-André Leimeister
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j9]Chris-André Leimeister, Thomas Dencker, Burkhard Morgenstern:
Accurate multiple alignment of distantly related genome sequences using filtered spaced word matches as anchor points. Bioinform. 35(2): 211-218 (2019)- [j8]Anna-Katharina Lau, Svenja Dörrer, Chris-André Leimeister, Christoph Bleidorn, Burkhard Morgenstern:
Read-SpaM: assembly-free and alignment-free comparison of bacterial genomes with low sequencing coverage. BMC Bioinform. 20-S(20): 638 (2019) - 2018
- [c3]Thomas Dencker, Chris-André Leimeister, Michael Gerth, Christoph Bleidorn, Sagi Snir, Burkhard Morgenstern:
Multi-SpaM: A Maximum-Likelihood Approach to Phylogeny Reconstruction Using Multiple Spaced-Word Matches and Quartet Trees. RECOMB-CG 2018: 227-241 - 2017
- [j7]Burkhard Morgenstern
, Svenja Schöbel, Chris-André Leimeister:
Phylogeny reconstruction based on the length distribution of k-mismatch common substrings. Algorithms Mol. Biol. 12(1): 27:1-27:12 (2017) - [j6]Chris-André Leimeister, Salma Sohrabi-Jahromi, Burkhard Morgenstern:
Fast and accurate phylogeny reconstruction using filtered spaced-word matches. Bioinform. 33(7): 971-979 (2017) - 2016
- [j5]Lars Hahn, Chris-André Leimeister, Rachid Ounit, Stefano Lonardi, Burkhard Morgenstern:
rasbhari: Optimizing Spaced Seeds for Database Searching, Read Mapping and Alignment-Free Sequence Comparison. PLoS Comput. Biol. 12(10) (2016) - 2015
- [j4]Burkhard Morgenstern, Binyao Zhu, Sebastian Horwege, Chris Leimeister:
Estimating evolutionary distances between genomic sequences from spaced-word matches. Algorithms Mol. Biol. 10: 5 (2015) - [i1]Lars Hahn, Chris-André Leimeister, Burkhard Morgenstern:
RasBhari: optimizing spaced seeds for database searching, read mapping and alignment-free sequence comparison. CoRR abs/1511.04001 (2015) - 2014
- [j3]Chris-André Leimeister, Marcus Boden, Sebastian Horwege, Sebastian Lindner, Burkhard Morgenstern:
Fast alignment-free sequence comparison using spaced-word frequencies. Bioinform. 30(14): 1991-1999 (2014) - [j2]Chris-André Leimeister, Burkhard Morgenstern:
kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison. Bioinform. 30(14): 2000-2008 (2014) - [j1]Sebastian Horwege, Sebastian Lindner, Marcus Boden, Klas Hatje, Martin Kollmar, Chris-André Leimeister, Burkhard Morgenstern:
Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches. Nucleic Acids Res. 42(Webserver-Issue): 7-11 (2014) - [c2]Burkhard Morgenstern, Binyao Zhu, Sebastian Horwege, Chris-André Leimeister:
Estimating Evolutionary Distances from Spaced-Word Matches. WABI 2014: 161-173 - 2013
- [c1]Marcus Boden, Martin Schöneich, Sebastian Horwege, Sebastian Lindner, Chris Leimeister, Burkhard Morgenstern:
Alignment-free sequence comparison with spaced k-mers. GCB 2013: 24-34
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-04-25 05:43 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:
