The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree

Published 2012 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
Authors
Keywords
-
Journal
SIAM JOURNAL ON COMPUTING
Volume 41, Issue 1, Pages 272-291
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Online
2012-02-17
DOI
10.1137/100811489

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.