David Fernández-Baca
David Fernández-Baca
Professor of Computer Science, Iowa State University
Verified email at iastate.edu
Cited by
Cited by
Allocating modules to processors in a distributed system
D Fernández-Baca
IEEE Transactions on Software Engineering 15 (11), 1427-1436, 1989
A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed
R Agarwala, D Fernández-Baca
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 140-147, 1993
Robinson-foulds supertrees
MS Bansal, JG Burleigh, O Eulenstein, D Fernández-Baca
Algorithms for molecular biology 5 (1), 1-12, 2010
iGTP: a software package for large-scale gene tree parsimony analysis
R Chaudhary, MS Bansal, A Wehe, D Fernández-Baca, O Eulenstein
BMC bioinformatics 11 (1), 1-7, 2010
Fast algorithms for bipartite network flow
D Gusfield, C Martel, D Fernandez-Baca
SIAM Journal on Computing 16 (2), 237-251, 1987
Performance of flip supertree construction with a heuristic algorithm
O Eulenstein, D Chen, JG Burleigh, D Fernández-Baca, MJ Sanderson
Systematic Biology 53 (2), 299-308, 2004
Flipping: a supertree construction method
D Chen, L Diao, O Eulenstein, D Fernández-Baca, MJ Sanderson
DIMACS series in discrete mathematics and theoretical computer science 61 …, 2003
Improved heuristics for minimum-flip supertree construction
D Chen, O Eulenstein, D Fernández-Baca, JG Burleigh
Evolutionary Bioinformatics 2, 117693430600200003, 2006
Minimum-flip supertrees: complexity and algorithms
D Chen, O Eulenstein, D Fernandez-Baca, M Sanderson
IEEE/ACM transactions on computational biology and bioinformatics 3 (2), 165-173, 2006
The perfect phylogeny problem
D Fernández-Baca
Steiner Trees in Industry, 203-234, 2001
Inferring species trees from incongruent multi-copy gene trees using the Robinson-Foulds distance
R Chaudhary, JG Burleigh, D Fernández-Baca
Algorithms for Molecular Biology 8 (1), 1-12, 2013
Using sparsification for parametric minimum spanning tree problems
D Fernández-Baca, G Slutzki, D Eppstein
Scandinavian Workshop on Algorithm Theory, 149-160, 1996
A polynomial-time algorithm for near-perfect phylogeny
D Fernández-Baca, J Lagergren
SIAM Journal on Computing 32 (5), 1115-1127, 2003
Comparing and aggregating partially resolved trees
MS Bansal, J Dong, D Fernández-Baca
Theoretical Computer Science 412 (48), 6634-6652, 2011
MRF supertrees
JG Burleigh, O Eulenstein, D Fernández-Baca, MJ Sanderson
Phylogenetic Supertrees, 65-85, 2004
MulRF: a software package for phylogenetic analysis using multi-copy gene trees
R Chaudhary, D Fernández-Baca, JG Burleigh
Bioinformatics 31 (3), 432-433, 2015
Supertrees by flipping
D Chen, O Eulenstein, D Fernández-Baca, M Sanderson
International Computing and Combinatorics Conference, 391-400, 2002
Rainbow: a toolbox for phylogenetic supertree construction and analysis
D Chen, O Eulenstein, D Fernández-Baca
Bioinformatics 20 (16), 2872-2873, 2004
Computing distances between partial rankings
MS Bansal, D Fernández-Baca
Information Processing Letters 109 (4), 238-241, 2009
EvoMiner: frequent subtree mining in phylogenetic databases
A Deepak, D Fernández-Baca, S Tirthapura, MJ Sanderson, ...
Knowledge and Information Systems 41 (3), 559-590, 2014
The system can't perform the operation now. Try again later.
Articles 1–20