![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
André Wehe
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
- [j6]André Wehe, J. Gordon Burleigh, Oliver Eulenstein:
Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 10(6): 1432-1441 (2013) - 2010
- [j5]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) - [j4]André Wehe, Wen-Chieh Chang, Oliver Eulenstein, Srinivas Aluru:
A scalable parallelization of the gene duplication problem. J. Parallel Distributed Comput. 70(3): 237-244 (2010) - 2009
- [j3]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) - [j2]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) - 2008
- [j1]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)
Conference and Workshop Papers
- 2012
- [c5]André Wehe, J. Gordon Burleigh, Oliver Eulenstein:
Algorithms for Knowledge-Enhanced Supertrees. ISBRA 2012: 263-274 - 2010
- [c4]André Wehe, John Gordon Burleigh:
Scaling the Gene Duplication Problem Towards the Tree of Life. BICoB 2010: 133-138 - 2009
- [c3]Glenn R. Luecke, James Coyle, James Hoekstra, Marina Kraeva, Ying Xu, Mi-Young Park, Elizabeth Kleiman, Olga Weiss, André Wehe, Melissa Yahya:
The Importance of Run-Time Error Detection. Parallel Tools Workshop 2009: 145-155 - 2008
- [c2]J. Gordon Burleigh, Mukul S. Bansal
, André Wehe, Oliver Eulenstein:
Locating Multiple Gene Duplications through Reconciled Trees. RECOMB 2008: 273-284 - 2007
- [c1]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
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint