Skip to Main Content
MIT Press Direct, home
header search
Search
Advanced Search
Skip Nav Destination
ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks
ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks
By
Dan Gusfield
Dan Gusfield

Dan Gusfield is Professor of Computer Science at the University of California, Davis. He is the coauthor of The Stable Marriage Problem: Structure and Algorithms (MIT Press) and author of Algorithms on Strings, Trees, and Sequences.

Search for other works by this author on:
This Site
Google Scholar
The MIT Press
DOI:
https://doi.org/10.7551/mitpress/9432.001.0001
ISBN electronic:
9780262324472
Publication date:
2014
Book Chapter

11: Conditions to Guarantee a Fully Decomposed MinARG

Doi:
https://doi.org/10.7551/mitpress/9432.003.0013
  • Published:
    2014
You do not currently have access to this chapter.
Don't already have an account? Register
A product of The MIT Press
Newsletter sign up

MIT Press Direct

Information

MIT Press

Contact Us

© 2024 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept