Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Oliver Eulenstein

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ruchi Chaudhary

> Home > Persons > Oliver Eulenstein

Publications

2012
[j21]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/bmcbi/ChaudharyBE12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bmcbi/ChaudharyBE12
Ruchi Chaudhary, J. Gordon Burleigh, Oliver Eulenstein:
Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence. BMC Bioinform. 13(S-10): S11 (2012)
2011
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/isbra/ChaudharyBE11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isbra/ChaudharyBE11
Ruchi Chaudhary, J. Gordon Burleigh, Oliver Eulenstein:
Algorithms for Rapid Error Correction for the Gene Duplication Problem. ISBRA 2011: 227-239
2010
[j12]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/bmcbi/ChaudharyBWFE10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bmcbi/ChaudharyBWFE10
Ruchi Chaudhary, Mukul S. Bansal, André Wehe, David Fernández-Baca, Oliver Eulenstein:
iGTP: A software package for large-scale gene tree parsimony analysis. BMC Bioinform. 11: 574 (2010)

a service of

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.