"An Integer Linear Programming Solution for the Most Parsimonious ..."

Morgan Carothers et al. (2020)

> Home

Details and statistics

DOI: 10.1145/3388440.3412474

access: closed

type: Conference or Workshop Paper

metadata version: 2020-11-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/bcb/CarothersGGKLPQ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bcb/CarothersGGKLPQ20
Morgan Carothers, Joseph Gardi, Gianluca Gross, Tatsuki Kuze, Nuo Liu, Fiona Plunkett, Julia Qian, Yi-Chieh Wu:
An Integer Linear Programming Solution for the Most Parsimonious Reconciliation Problem under the Duplication-Loss-Coalescence Model. BCB 2020: 52:1-52:12

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.