Остановите войну!
for scientists:
default search action
Oliver Eulenstein
- > Home > Persons > Oliver Eulenstein
Publications
- 2013
- [j23]Mukul S. Bansal, Oliver Eulenstein:
Algorithms for Genome-Scale Phylogenetics Using Gene Tree Parsimony. IEEE ACM Trans. Comput. Biol. Bioinform. 10(4): 939-956 (2013) - 2010
- [j14]Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein, David Fernández-Baca:
Robinson-Foulds Supertrees. Algorithms Mol. Biol. 5: 18 (2010) - [j13]Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein:
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models. BMC Bioinform. 11(S-1): 42 (2010) - [j12]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) - [c15]J. Gordon Burleigh, Mukul S. Bansal, Oliver Eulenstein, Todd J. Vision:
Inferring species trees from gene duplication episodes. BCB 2010: 198-203 - 2009
- [j9]John Gordon Burleigh, Mukul S. Bansal, André Wehe, Oliver Eulenstein:
Locating Large-Scale Gene Duplication Events through Reconciled Trees: Implications for Identifying Ancient Polyploidy Events in Plants. J. Comput. Biol. 16(8): 1071-1083 (2009) - [j8]Mukul S. Bansal, Oliver Eulenstein, André Wehe:
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches. IEEE ACM Trans. Comput. Biol. Bioinform. 6(2): 221-231 (2009) - [c12]Mukul S. Bansal, Wen-Chieh Chang, Oliver Eulenstein, David Fernández-Baca:
Generalized Binary Tanglegrams: Algorithms and Applications. BICoB 2009: 114-125 - 2008
- [j7]André Wehe, Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein:
DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony. Bioinform. 24(13): 1540-1541 (2008) - [j6]Mukul S. Bansal, Oliver Eulenstein:
An Omega(n^2/ log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 5(4): 514-524 (2008) - [c11]Mukul S. Bansal, Oliver Eulenstein:
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI Based Local Searches. ISBRA 2008: 14-25 - [c10]Mukul S. Bansal, Oliver Eulenstein:
The multiple gene duplication problem revisited. ISMB 2008: 132-138 - [c9]J. Gordon Burleigh, Mukul S. Bansal, André Wehe, Oliver Eulenstein:
Locating Multiple Gene Duplications through Reconciled Trees. RECOMB 2008: 273-284 - 2007
- [c8]Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein, André Wehe:
Heuristics for the Gene-Duplication Problem: A Theta ( n ) Speed-Up for the Local Search. RECOMB 2007: 238-252 - [c7]Mukul S. Bansal, Oliver Eulenstein:
An Omega(n2/log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem. WABI 2007: 124-135
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-03 19:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint