skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Award ID contains: 1751399

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; (, Journal of Computational Biology)
    Full Text Available 
  2. ; ; (, IEEE/ACM Transactions on Computational Biology and Bioinformatics)
    Full Text Available 
  3. ; ; ; ; ; ; ; ; (, IEEE/ACM Transactions on Computational Biology and Bioinformatics)
  4. ; ; (, 21st International Workshop on Algorithms in Bioinformatics (WABI 2021))
    Carbone, Alessandra; El-Kebir, Mohammed (Ed.)
    The maximum parsimony phylogenetic reconciliation problem seeks to explain incongruity between a gene phylogeny and a species phylogeny with respect to a set of evolutionary events. While the reconciliation problem is well-studied for species and gene trees subject to events such as duplication, transfer, loss, and deep coalescence, recent work has examined species phylogenies that incorporate hybridization and are thus represented by networks rather than trees. In this paper, we show that the problem of computing a maximum parsimony reconciliation for a gene tree and species network is NP-hard even when only considering deep coalescence. This result suggests that future work on maximum parsimony reconciliation for species networks should explore approximation algorithms and heuristics. 
    more » « less
    Full Text Available 
  5. ; ; ; ; ; ; ; (, Bioinformatics)
    Russell, Schwartz (Ed.)
    Abstract Summary We describe eMPRess, a software program for phylogenetic tree reconciliation under the duplication-transfer-loss model that systematically addresses the problems of choosing event costs and selecting representative solutions, enabling users to make more robust inferences. Availability and implementation eMPRess is freely available at http://www.cs.hmc.edu/empress. Supplementary information Supplementary data are available at Bioinformatics online. 
    more » « less
    Full Text Available 
  6. ; ; ; ; ; ; ; (, 11th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB 2020))
    null (Ed.)
    Full Text Available 
  7. ; ; ; (, BMC Bioinformatics)
    Full Text Available