| 2009 |
|---|
| 10 | EE | Mukul S. Bansal,
Wen-Chieh Chang,
Oliver Eulenstein,
David Fernández-Baca:
Generalized Binary Tanglegrams: Algorithms and Applications.
BICoB 2009: 114-125 |
| 9 | EE | Mukul S. Bansal,
David Fernández-Baca:
Computing distances between partial rankings.
Inf. Process. Lett. 109(4): 238-241 (2009) |
| 2008 |
|---|
| 8 | EE | Mukul S. Bansal,
Oliver Eulenstein:
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI Based Local Searches.
ISBRA 2008: 14-25 |
| 7 | EE | Mukul S. Bansal,
Oliver Eulenstein:
The multiple gene duplication problem revisited.
ISMB 2008: 132-138 |
| 6 | EE | Mukul S. Bansal,
Jianrong Dong,
David Fernández-Baca:
Comparing and Aggregating Partially Resolved Trees.
LATIN 2008: 72-83 |
| 5 | EE | J. Gordon Burleigh,
Mukul S. Bansal,
André Wehe,
Oliver Eulenstein:
Locating Multiple Gene Duplications through Reconciled Trees.
RECOMB 2008: 273-284 |
| 4 | EE | André Wehe,
Mukul S. Bansal,
J. Gordon Burleigh,
Oliver Eulenstein:
DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.
Bioinformatics 24(13): 1540-1541 (2008) |
| 3 | EE | 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. Biology Bioinform. 5(4): 514-524 (2008) |
| 2007 |
|---|
| 2 | EE | 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 |
| 1 | EE | Mukul S. Bansal,
Oliver Eulenstein:
An Omega(n2/log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem.
WABI 2007: 124-135 |
