Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2830058
aliases / en / 0aliases / en / 0
 
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
description / endescription / en
 
scientific article; zbMATH DE number 6649746
Property / title
 
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees (English)
Property / title: Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1480.92142 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-41168-2_5 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithmic Aspects in Information and Management / rank
 
Normal rank
Property / publication date
 
9 November 2016
Timestamp+2016-11-09T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 9 November 2016 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C90 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6649746 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952589317 / rank
 
Normal rank

Revision as of 09:58, 6 May 2024

scientific article; zbMATH DE number 6649746
  • Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
Language Label Description Also known as
English
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
scientific article; zbMATH DE number 6649746
  • Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees

Statements

Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (English)
0 references
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees (English)
0 references
0 references
0 references
0 references
0 references
20 October 2017
0 references
9 November 2016
0 references
phylogenetics
0 references
compatibility
0 references
unrooted phylogenetic trees
0 references
parameterized complexity
0 references
FPT algorithm
0 references
dynamic programming
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references