Follow
Chris-André Leimeister
Chris-André Leimeister
Verified email at stud.uni-goettingen.de
Title
Cited by
Cited by
Year
Benchmarking of alignment-free sequence comparison methods
A Zielezinski, HZ Girgis, G Bernard, CA Leimeister, K Tang, T Dencker, ...
Genome biology 20, 1-18, 2019
1822019
Fast alignment-free sequence comparison using spaced-word frequencies
CA Leimeister, M Boden, S Horwege, S Lindner, B Morgenstern
Bioinformatics 30 (14), 1991-1999, 2014
1532014
kmacs: the k -mismatch average common substring approach to alignment-free sequence comparison
CA Leimeister, B Morgenstern
Bioinformatics 30 (14), 2000-2008, 2014
1262014
Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches
S Horwege, S Lindner, M Boden, K Hatje, M Kollmar, CA Leimeister, ...
Nucleic acids research 42 (W1), W7-W11, 2014
772014
Fast and accurate phylogeny reconstruction using filtered spaced-word matches
CA Leimeister, S Sohrabi-Jahromi, B Morgenstern
Bioinformatics 33 (7), 971-979, 2017
672017
Estimating evolutionary distances between genomic sequences from spaced-word matches
B Morgenstern, B Zhu, S Horwege, CA Leimeister
Algorithms for Molecular Biology 10, 1-12, 2015
582015
rasbhari: Optimizing Spaced Seeds for Database Searching, Read Mapping and Alignment-Free Sequence Comparison
L Hahn, CA Leimeister, R Ounit, S Lonardi, B Morgenstern
PLoS computational biology 12 (10), e1005107, 2016
392016
Prot-SpaM: fast alignment-free phylogeny reconstruction based on whole-proteome sequences
CA Leimeister, J Schellhorn, S Dörrer, M Gerth, C Bleidorn, ...
GigaScience 8 (3), giy148, 2019
292019
Alignment-free sequence comparison with spaced k-mers
M Boden, M Schöneich, S Horwege, S Lindner, C Leimeister, ...
German Conference on Bioinformatics 2013, 2013
272013
Read-SpaM: assembly-free and alignment-free comparison of bacterial genomes with low sequencing coverage
AK Lau, S Dörrer, CA Leimeister, C Bleidorn, B Morgenstern
BMC bioinformatics 20, 1-15, 2019
232019
‘Multi-SpaM’: a maximum-likelihood approach to phylogeny reconstruction using multiple spaced-word matches and quartet trees
T Dencker, CA Leimeister, M Gerth, C Bleidorn, S Snir, B Morgenstern
NAR Genomics and Bioinformatics 2 (1), lqz013, 2020
222020
Phylogeny reconstruction based on the length distribution of k-mismatch common substrings
B Morgenstern, S Schöbel, CA Leimeister
Algorithms for Molecular Biology 12, 1-12, 2017
192017
Accurate multiple alignment of distantly related genome sequences using filtered spaced word matches as anchor points
CA Leimeister, T Dencker, B Morgenstern
Bioinformatics 35 (2), 211-218, 2019
132019
Estimating evolutionary distances from spaced-word matches
B Morgenstern, B Zhu, S Horwege, CA Leimeister
Algorithms in Bioinformatics: 14th International Workshop, WABI 2014 …, 2014
52014
Multi-SpaM: a maximum-likelihood approach to phylogeny reconstruction based on multiple spaced-word matches
T Dencker, CA Leimeister, M Gerth, C Bleidorn, S Snir, B Morgenstern
arXiv preprint arXiv:1803.09222, 2018
42018
Filtered spaced-word matches: a novel approach to fast and accurate sequence comparison
CA Leimeister
Niedersächsische Staats-und Universitätsbibliothek Göttingen, 2019
12019
Anchor points for genome alignment based on filtered spaced word matches
CA Leimeister, T Dencker, B Morgenstern
arXiv preprint arXiv:1703.08792, 2017
12017
Supplementary Material for Multi-SpaM: a Maximum-Likelihood approach to Phylogeny reconstruction using Multiple Spaced-Word Matches and Quartet Trees
T Dencker, CA Leimeister, M Gerth, C Bleidorn, S Snir, B Morgenstern
2019
Estimating phylogenetic distances between genomic sequences based on the length distribution of k-mismatch common substrings
B Morgenstern, S Schöbel, CA Leimeister
arXiv preprint arXiv:1709.01371, 2017
2017
A Novel Pseudo-Alignment Approach to Fast Genomic Sequence Comparison
CA Leimeister
2015
The system can't perform the operation now. Try again later.
Articles 1–20