Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michael Höhl

dblp:74/2562 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2002
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence alignment › genome alignment
multiple genome alignment
0.012002
Efficient multiple genome alignment · ISMB 2002
Bioinformatics and computational biology
sequence alignment
0.012002
Efficient multiple genome alignment · ISMB 2002

Methods — techniques the papers use, named apart from their topics

suffix tree · 0.0graph algorithms · 0.0
YearPublicationVenuePosition
2002 Efficient multiple genome alignment
abstract
Abstract Motivation: To allow a direct comparison of the genomic DNA sequences of sufficiently similar organisms, there is an urgent need for software tools that can align more than two genomic sequences. Results: We developed new algorithms and a software tool ‘Multiple Genome Aligner’ (MGA for short) that efficiently computes multiple genome alignments of large, closely related DNA sequences. For example, it can align 85% percent of the complete genomes of six human adenoviruses (average length 35305 bp.) in 159 seconds. An alignment of 74% of the complete genomes of three of strains of E. coli (lengths: 5528445; 5498450; 4639221~bp.) is produced in 30 minutes. Availability: The software MGA is available free of charge for non-commercial research institutions. For details see http://bibiserv.techfak.uni-bielefeld.de/mga/ Contact: [email protected]@techfak.uni-bielefeld.de Keywords: genome comparison; multiple alignment; efficient algorithms; graph algorithms; suffix trees.
Michael Höhl, Stefan Kurtz, Enno Ohlebusch
ISMB1