Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable

ISSN： 0178-4617

Source： Algorithmica, Vol.68, Iss.4, 2014-04, pp. : 886-915

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

By Fellows M. Knauer C. Nishimura N. Ragde P. Rosamond F. Stege U. Thilikos D. Whitesides S.

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 167-176

Springer Publishing Company

Access to resources Recommend Favorite

An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization

By Dujmovic Vida Whitesides Sue

Algorithmica, Vol. 40, Iss. 1, 2004-06 ,pp. : 15-31

Springer Publishing Company

Access to resources Recommend Favorite

Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets

By Huber K.

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 714-738

Springer Publishing Company

Access to resources Recommend Favorite

Constructing a typology for networks of firms

By Patrick Burlat

Production Planning and Control, Vol. 14, Iss. 5, 2003-07 ,pp. : 399-409

Taylor & Francis Ltd

Access to resources Recommend Favorite

Design and evaluation of transportation networks: constructing transportation networks from perspectives of service integration, infrastructure investment and information system implementation

By Shi Xiaoning

Netnomics, Vol. 11, Iss. 1, 2010-04 ,pp. : 1-4

Springer Publishing Company

Access to resources Recommend Favorite