Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Quick path finding--quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes.

Computational biology and chemistry - 1 Dec 2010

Płoński Piotr, Radomski Jan P

Abstract excerpt

Ever increasing amounts of genetic information stored in sequential databases require efficient methods to automatically reveal their phylogenetic relationships. A framework for in silico unambiguous analysis of phylogenetic trees, based on information contained in tree's topology, together with...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Computer Simulation
Share to Databases, Genetic

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Evolution, Molecular

Share to Genetic Variation

Share to Phylogeny

Source

Identifiers

PMID: 20980202
DOI: 10.1016/j.compbiolchem.2010.10.002

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 2 Sept 2026. Prepared record publication-20980202-2026-09-02.2. Manifest publication-graph-cohort-2026-09-02.2.

Source receipt: PubMed via Helena Literature Corpus, retrieved 2 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 10 closest

Quick path finding--quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes.PMID 20980202Read ↗

Phylogenomics.Semantic proximity Read ↗

Phylogenetic--evolutionary approaches to bioinformatics.Semantic proximity Read ↗

Convenient method to improve the graphical quality of phylogenetic trees computed by the MEGA program.Semantic proximity Read ↗

Phylogenetic tree-building.Semantic proximity Read ↗

Pandit: a database of protein and associated nucleotide domains with inferred trees.Semantic proximity Read ↗

Identifying evolutionary trees and substitution parameters for the general Markov model with invariable sites.Semantic proximity Read ↗

Toward extracting all phylogenetic information from matrices of evolutionary distances.Semantic proximity Read ↗

Fixed-parameter algorithms in phylogenetics.Semantic proximity Read ↗

Reconstructing recombination network from sequence data: the small parsimony problem.Semantic proximity Read ↗

The undirected incomplete perfect phylogeny problem.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.