For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
12
views
25
references
 Top references
cited by
2
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,481
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Article: not found

      Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references25

          • Record: found
          • Abstract: not found
          • Article: not found

          A Decomposition Theorem for Partially Ordered Sets

          R. Dilworth (1950)
          Article 0 comments Cited 122 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Efficient algorithms for inferring evolutionary trees

            Dan Gusfield (1991)
            Article 0 comments Cited 97 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              The Transitive Reduction of a Directed Graph

              A. Aho, M. Garey, J. D. Ullman (1972)
              Article 0 comments Cited 78 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and article information

                Journal
                Title: ACM Transactions on Algorithms
                Abbreviated Title: ACM Trans. Algorithms
                Abbreviated Title: TALG
                Publisher: Association for Computing Machinery (ACM)
                ISSN (Print): 15496325
                Publication date Created: June 04 2018
                Publication date (Print): April 16 2018
                Volume: 14
                Issue: 2
                Pages: 1-26
                Affiliations
                [1 ]University of Primorska, Koper, Slovenia
                [2 ]London School of Economics and University of Primorska, Koper, Slovenia
                [3 ]University of Verona, Verona, Italy
                [4 ]Helsinki Institute for Information Technology HIIT and University of Helsinki, Finland
                Article
                DOI: 10.1145/3182178
                SO-VID: e67289b3-246b-436f-90c0-df363c7c232f
                Copyright © © 2018
                License:

                http://www.acm.org/publications/policies/copyright_policy#Background

                History

                Data availability:

                Comments

                Comment on this article