- vom 3.3.2022
Detecting High Scoring Local Alignments in Pangenome Graphs
In: Bioinformatics, Jg. 37 H. 16, S. 2266-22742021
- vom 14.7.2021
WebCARMA: a web application for the functional and taxonomic classification of unassembled metagenomic reads
In: BMC Bioinformatics, Jg. 10 H. 1, S. 430 ff.2009The complete genome sequence of the acarbose producer Actinoplanes sp. SE50/110
In: BMC Genomics, Jg. 13 H. 12012Taxonomic classification of metagenomic shotgun sequences with CARMA3.
In: Nucleic Acids Res, Jg. 39 H. 14, S. e91 ff.2011Statistics for approximate gene clusters
In: BMC Bioinformatics, Jg. 14 H. Suppl 15: Proc. of RECOMB-CG 20132013Simple and flexible detection of contiguous repeats using a suffix tree
In: Theoretical Computer Science, Jg. 270 H. 1-2, S. 843-8562002REPuter: the manifold applications of repeat analysis on a genomic scale
In: Nucleic Acids Research, Jg. 29 H. 22, S. 4633-46422001QAlign: quality-based multiple alignments with dynamic phylogenetic analysis
In: BIOINFORMATICS, Jg. 19 H. 12, S. 1592-15932003Phylogenetic classification of short environmental DNA fragments
In: Nucleic Acids Research, Jg. 36 H. 7, S. 2230-22392008Orthology Detection Combining Clustering and Synteny for Very Large Datasets
In: PLoS ONE, Jg. 9 H. 82014On the weight of indels in genomic distances
In: BMC Bioinformatics, Jg. 12 H. Suppl 9: RECOMB-CG 20112011On the Inversion-Indel Distance
In: BMC Bioinformatics, Jg. 14 H. Suppl 15: Proc. of RECOMB-CG 20132013Multiple sequence alignment with the Divide-and-Conquer method.
In: Gene, Jg. 211 H. 2, S. GC45-GC561998Multiple genome comparison based on overlap regions of pairwise local alignments
In: BMC Bioinformatics, Jg. 13 H. Suppl. 19: Proc. of RECOMB-CG 20122012Linear time algorithms for finding and representing all the tandem repeats in a string
In: Journal of computer and system sciences, Jg. 69 H. 4, S. 525-5462004Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment
In: Applied mathematics letters, Jg. 10 H. 2, S. 67-731997Identifying Gene Clusters by Discovering Common Intervals in Indeterminate Strings
In: BMC Genomics, Jg. 15 H. Suppl. 6: Proc. of RECOMB-CG 20142014
- vom 13.7.2021
GraphTeams. A method for discovering spatial gene clusters in Hi-C sequencing data
In: BMC Genomics, Jg. 19 H. Suppl. 52018GISMO - gene identification using a support vector machine for ORF classification
In: Nucleic Acids Research, Jg. 35 H. 2, S. 540-5492007Genomic distance under gene substitutions
In: BMC Bioinformatics, Jg. 12 H. Suppl 9: Proc. of RECOMB-CG 20112011Gene family assignment-free comparative genomics
In: BMC Bioinformatics, Jg. 13 H. Suppl 19: Proc. of RECOMB-CG 20122012Finding all maximal perfect haplotype blocks in linear time
In: Algorithms for Molecular Biology, Jg. 152020Efficient implementation of lazy suffix trees
In: SOFTWARE-PRACTICE & EXPERIENCE, Jg. 33 H. 11, S. 1035-10492003Divide-and-conquer multiple alignment with segment-based constraints
In: BIOINFORMATICS, Jg. 19 H. Suppl 2, S. ii189-ii1952003Correction: Benchmarking tools for the alignment of functional noncoding DNA
In: BMC Bioinformatics, Jg. 5 H. 12004