Biblio

Export 98 results:
[ Author(Desc)] Keyword Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
C
C. Coarfa, Dotsenko, Y., Mellor-Crummey, J., Nakhleh, L., and Roshan, U., PRec-I-DCM3: A Parallel Framework for Fast and Accurate Large Scale Phylogeny Reconstruction, in Proceedigns of the First IEEE Workshop on High Performance Computing in Medicine and Biology, 2005, vol. 2, pp. 346-350.
D
Y. Dotsenko, Coarfa, C., Nakhleh, L., Mellor-Crummey, J., and Roshan, U., PRec-I-DCM3: A Parallel Framework for Fast and Accurate Large Scale Phylogeny Reconstruction, International Journal on Bioinformatics Research and Applications, vol. 2, pp. 407-419, 2006.
Z. Du, Stamatakis, A., Lin, F., Roshan, U., and Nakhleh, L., Parallel divide-and-conquer phylogeny reconstruction by maximum likelihood, in Proceedings of the 2005 International Conference on High Performance Computing and Communications, 2005, vol. 2, pp. 346-350.
E
R. A. L. Elworth and Nakhleh, L., Inferring local genealogies on closely related genomes, RECOMB Comparative Genomics. 2017.
E. Erdem, Lifschitz, V., Nakhleh, L., and Ringe, D., Reconstructing the Evolutionary History of Indo-European Languages using Answer Set Programming, in Proceedings of the Fifth International Symposium on Practical Aspects of Declarative Languages (PADL 2003), 2003, vol. 2562, pp. 160-176.
J
G. Jin, Nakhleh, L., Snir, S., and Tuller, T., A New Linear-time Heuristic Algorithm for Computing the Parsimony Score of Phylogenetic Networks: Theoretical Bounds and Empirical Performance, in Proceedings of the International Symposium on Bioinformatics Research and Applications, 2007, vol. 4463, pp. 61-72.
G. Jin, Nakhleh, L., Snir, S., and Tuller, T., Efficient parsimony-based methods for phylogenetic network reconstruction, Bioinformatics, vol. 23, pp. e123-e128, 2006.
G. Jin, Nakhleh, L., Snir, S., and Tuller, T., Parsimony Score of Phylogenetic Networks: Hardness Results and a Linear-time Heuristic, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 6, pp. 495-505, 2009.
G. Jin, Nakhleh, L., Snir, S., and Tuller, T., Inferring phylogenetic networks by the maximum parsimony criterion: a case study, Molecular Biology and Evolution, vol. 24, pp. 324-337, 2007.
G. Jin, Nakhleh, L., Snir, S., and Tuller, T., Maximum likelihood of phylogenetic networks, Bioinformatics, vol. 22, pp. 2604-2611, 2006.
G. Jin, Nakhleh, L., and Than, C., Integrating Sequence and Topology for Efficient and Accurate Detection of Horizontal Gene Transfer, in Proceedings of the Sixth RECOMB Comparative Genomics Satellite Workshop, 2008, vol. 5267, pp. 113-127.
K
I. A. Kanj, Nakhleh, L., and Xia, G., The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms, Algorithmica, vol. 51, pp. 99-128, 2008.
I. A. Kanj, Nakhleh, L., Than, C., and Xia, G., Seeing the trees and their branches in the network is hard, Theoretical Computer Science, vol. 401, pp. 153-164, 2008.
I. A. Kanj, Nakhleh, L., Than, C., and Xia, G., Seeing the trees and their branches in the network is hard, in Proceedings of the Tenth Italian Conference on Theoretical Computer Science (ICTCS), 2007, pp. 82-93.
I. Kanj, Nakhleh, L., and Xia, G., Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms, in Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON 2006), 2006, vol. 4112, pp. 299-308.

Pages