On the Generalised Character Compatibility Problem for Non-branching Character Trees (Q5323073): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1523916760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring Evolutionary History From DNA Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating Vertex-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Ordering Problem / 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: Building PQR trees in almost-linear time / rank
 
Normal rank

Latest revision as of 20:22, 1 July 2024

scientific article; zbMATH DE number 5585627
Language Label Description Also known as
English
On the Generalised Character Compatibility Problem for Non-branching Character Trees
scientific article; zbMATH DE number 5585627

    Statements