A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors (Q845860): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2006.05.013 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142543306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing the shape of a tree from observed dissimilarity data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring evolutionary trees with strong combinatorial evidence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Optimal Trees from Quartets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree structures for proximity data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing big trees from short sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A few logs suffice to build (almost) all trees (I) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter algorithm for minimum quartet inconsistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Likelihood for Genome Phylogeny on Gene Content / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2006.05.013 / rank
 
Normal rank

Latest revision as of 05:01, 10 December 2024

scientific article
Language Label Description Also known as
English
A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors
scientific article

    Statements

    Identifiers