UMAST specifications

Information


Unique identifier OMICS_24849
Name UMAST
Interface Web user interface
Restrictions to use None
Input data Two phylogenic trees.
Input format NEWICK
Computer skills Basic
Stability Stable
Maintained Yes

Maintainer


  • person_outline Sergey Spirin

UMAST citation

library_books

Tree edit distance for leaf labelled trees on free leafset and its comparison with frequent subsplit dissimilarity and popular distance measures

2011
BMC Bioinformatics
PMCID: 3117735
PMID: 21612645
DOI: 10.1186/1471-2105-12-204

[…] f h needs to be removed to achieve an identical tree TM, which is a maximum agreement subtree of T1 and T2.Several versions of the MAST problem exist like RMAST, which considers only rooted trees, or UMAST for general unrooted trees.A MAST problem without any restrictions is generally NP-hard []. However when the degree of one input trees is limited, then the algorithm is polynomial []. Also, when […]

UMAST institution(s)
Belozersky Institute of PhysicoChemical Biology, Lomonosov Moscow State University, Moscow, Russia
UMAST funding source(s)
Supported by Russian Science Foundation, grant no. 16-14-10319.

UMAST reviews

star_border star_border star_border star_border star_border
star star star star star

Be the first to review UMAST