|
|
David Fernández-Baca Professor
Research Interests - Combinatorial algorithms, with emphasis on sensitivity analysis of optimization problems and evolutionary tree construction.
Research Areas - Algorithms, Bioinformatics and Computational Biology
Education - Ph.D. University of California, Davis. 1986
B.S. Computer Engineering, Universidad Nacional Autonoma de Mexico 1980
Current Grants Collaborative Research: Phylogenetic Trees for Comparative Biology. David Fernandez-Baca and Oliver Euulenstein. National Science Foundation (2008-2011). $800,000.
Representative Publications - Refereed Journal and Conference Publications
Mukul S. Bansal and David Fernandez-Baca. Computing Distances Between Partial Rankings. Information Processing Letters, Elsevier. Vol. 109. No. 4. pp. 238-241, 2009.
David Fernández-Baca and Balaji Venkatachalam. Parametric Analysis for Ungapped Markov Models of Evolution. ACM Transactions on Algorithms, Submitted, 2007.
Mukul S. Bansal1 Contact Information, Jianrong Dong1 Contact Information and David Fernández-Baca. Comparing and Aggregating Partially Resolved Trees. LATIN 2008: Theoretical Informatics, Buzios, Brazil, Springer LNCS. Vol. 4957. pp. 72-83, 2007.
Duhong Chen, J. Gordon Burleigh, and David Fernández-Baca. Spectral Partitioning of Phylogenetic Data Sets Based on Compatibility. Systematic Biology. Vol. 56. No. 4. pp. 623 – 632, Submitted, 2007.
D. Chen, O. Eulenstein, D. Fernández-Baca, and M.J. Sanderson. Minimum-flip supertrees: complexity and algorithms. IEEE Transactions on Bioinformatics and Computational Biology, 2006.
F. Sun, D. Fernández-Baca, and W. Yu. Inverse parametric sequence alignment. Journal of Algorithms, Elsevier. Vol. 53. No. 1. pp. 36--54, 2004.
O. Eulenstein, D. Chen, J.G. Burleigh, D. Fernández-Baca, and M.J. Sanderson. Performance of flip supertrees with a heuristic algorithm. Systematic Biology. Vol. 53. No. 2. pp. 299--308, 2004.
D. Fernández-Baca, T. Seppäläinen, and G. Slutzki. Parametric multiple sequence alignment and phylogeny construction. Journal of Discrete Algorithms. Vol. 2. No. 2. pp. 271---287, 2004.
D. Fernández-Baca and J. Lagergren. A polynomial-time algorithm for near-perfect phylogeny. SIAM Journal on Computing. Vol. 32. No. 5. pp. 1115-1127, 2003.
D. Fernández-Baca, T. Seppäläinen, and G. Slutzki. Bounds for parametric sequence comparison. Discrete Applied Mathematics, 2002.
D. Fernández-Baca. On nonlinear parametric search. Algorithmica, 2001.
|