From constrained to unconstrained maximum agreement subtree in linear time (Q2479535): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s00453-007-9084-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000823321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for inferring evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Contractions and Evolutionary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to find agreement subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kaikoura tree theorems: Computing the maximum agreement subtree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Compatibility and Inferring Evolutionary History / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:53, 27 June 2024

scientific article
Language Label Description Also known as
English
From constrained to unconstrained maximum agreement subtree in linear time
scientific article

    Statements

    From constrained to unconstrained maximum agreement subtree in linear time (English)
    0 references
    0 references
    0 references
    3 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Maximum agreement subtrees
    0 references
    Constrained maximum agreement subtrees
    0 references
    Consensus
    0 references
    Reduction
    0 references
    Bioinformatics
    0 references
    Evolutionary trees
    0 references
    0 references