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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Heiko A. Schmidt

dblp:61/3124 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2007
0000-0002-2311-8592ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 3 · 2 first-authorSystems, architecture and hardware · 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
3 papers
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › phylogenetics › phylogenetic inference
maximum likelihood estimation		 0.122005
pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies · Bioinform. 2005
TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing · Bioinform. 2002
Bioinformatics and computational biology
phylogenetics		 0.122005
pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies · Bioinform. 2005
TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing · Bioinform. 2002
Parallel and multicore computing
parallel computing		 0.122007
pIPHULA - parallel inference of population parameters using a likelihood approach · Bioinform. 2007
TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing · Bioinform. 2002
Bioinformatics and computational biology
population genetics		 0.112007
pIPHULA - parallel inference of population parameters using a likelihood approach · Bioinform. 2007
Bioinformatics and computational biology › population genetics
population parameter estimation		 0.112007
pIPHULA - parallel inference of population parameters using a likelihood approach · Bioinform. 2007
Parallel and multicore computing › parallel computing › parallel bioinformatics
parallel phylogenetic inference		 0.112005
pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies · Bioinform. 2005
Parallel and multicore computing › parallel computing
parallel scientific computing		 0.112005
pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies · Bioinform. 2005
Parallel and multicore computing › parallel programming models
message passing		 0.012002
TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing · Bioinform. 2002

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

MPI · 0.3maximum likelihood · 0.1parallel tree search · 0.1quartet-based maximum likelihood · 0.1
YearPublicationVenuePosition
2007 pIPHULA - parallel inference of population parameters using a likelihood approach
abstract
Abstract Summary: pIPHULA is the parallel program to estimate the parameters of a realistic model of population growth. Availability: pIPHULA (http://www.cibiv.at/software/piphula) is written in ISO C, parallel and sequential executables run on UNIX/Linux, Windows and MacOS systems. For (free) MPI libraries see http://en.wikipedia.org/wiki/Message_Passing_Interface. Contact: [email protected] or [email protected] Supplementary information: Supplementary data are available at Bioinformatics online.
Heiko A. Schmidt, Arndt von Haeseler, Jutta Buschbom
 Bioinform.1
2005 pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies
abstract
Summary: IQPNNI is a program to infer maximum-likelihood phylogenetic trees from DNA or protein data with a large number of sequences. We present an improved and MPI-parallel implementation showing very good scaling and speedup behavior. Availability: IQPNNI (http://www.bi.uni-duesseldorf.de/software/iqpnni) is written in C++, executable on UNIX/Linux, Windows and MacOS systems. (Free) MPI libraries can be found at http://www.lam-mpi.org/mpi/implementations/. Contact: [email protected]
Bui Quang Minh, Le Sy Vinh, Arndt von Haeseler, Heiko A. Schmidt
 Bioinform.4
2003 Molecular phylogenetics: parallelized parameter estimation and quartet puzzling
Heiko A. Schmidt, Ekkehard Petzold, Martin Vingron, Arndt von Haeseler
 J. Parallel Distributed Comput.1
2002 TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing
abstract
SUMMARY: TREE-PUZZLE is a program package for quartet-based maximum-likelihood phylogenetic analysis (formerly PUZZLE, Strimmer and von Haeseler, Mol. Biol. Evol., 13, 964-969, 1996) that provides methods for reconstruction, comparison, and testing of trees and models on DNA as well as protein sequences. To reduce waiting time for larger datasets the tree reconstruction part of the software has been parallelized using message passing that runs on clusters of workstations as well as parallel computers. AVAILABILITY: http://www.tree-puzzle.de. The program is written in ANSI C. TREE-PUZZLE can be run on UNIX, Windows and Mac systems, including Mac OS X. To run the parallel version of PUZZLE, a Message Passing Interface (MPI) library has to be installed on the system. Free MPI implementations are available on the Web (cf. http://www.lam-mpi.org/mpi/implementations/).
Heiko A. Schmidt, Korbinian Strimmer, Martin Vingron, Arndt von Haeseler
 Bioinform.1