Constructing big trees from short sequences (Q4572010): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Mike A. Steel / rank
 
Normal rank
Property / author
 
Property / author: Tandy J. Warnow / 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.1007/3-540-63165-8_235 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1486005765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4866243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilities of rooted tree-shapes generated by random bifurcation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank

Latest revision as of 02:30, 16 July 2024

scientific article; zbMATH DE number 6898433
Language Label Description Also known as
English
Constructing big trees from short sequences
scientific article; zbMATH DE number 6898433

    Statements

    Constructing big trees from short sequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    short quartets method
    0 references
    \(L_\infty\)-nearest tree problem
    0 references
    0 references