Biblio

Export 16 results:
Author Keyword Title [ Type(Desc)] Year
Filters: First Letter Of Last Name is J  [Clear All Filters]
Conference Paper
L. Nakhleh, Moret, B. M. E., Roshan, U., John, S. K., Sun, J., and Warnow, T., “The Accuracy of Phylogenetic Methods for Large Datasets”, in Proc.\ 7th Pacific Symp. on Biocomputing ({PSB02}), 2002, vol. 7, pp. 211-222.
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.
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.
L. Nakhleh, Roshan, U., John, S. K., Sun, J., and Warnow, T., “The Performance of Phylogenetic Methods on Trees of Bounded Diameter”, in First International Workshop on Algorithms in Bioinformatics (WABI 01), 2001, vol. Lecture Notes in Computer Science 2149, pp. 214–226.
L. Nakhleh, Jin, G., Zhao, F., and Mellor-Crummey, J., “Reconstructing phylogenetic networks using maximum parsimony”, in Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference (CSB2005), 2005, pp. 93-102.
L. Nakhleh, Warnow, T., Linder, C. R., and John, S. K., “Reconstructing reticulate evolution in species–theory and practice”, in Journal of Computational Biology, 2005, vol. 12(6-7), pp. 796-811.
Conference Proceedings
H. J. Park, Jin, G., and Nakhleh, L., “Algorithmic strategies for estimating the amount of reticulation from a collection of gene trees”, Proceedings of the 9th Annual International Conference on Computational Systems Biology. pp. 114-123, 2010.PDF icon ParkEtAl-CSB2010.pdf (946.56 KB)
Journal Article
H. J. Park, Jin, G., and Nakhleh, L., “Bootstrap-based support of HGT inferred by maximum parsimony”, BMC Evolutionary Biology, vol. 10, p. 131, 2010.PDF icon BMCEvolBiol2010.pdf (1.18 MB)
L. Nakhleh, Roshan, U., John, S. K., Sun, J., and Warnow, T., “Designing Fast Converging Phylogenetic Methods”, Bioinformatics, vol. 17, pp. S190–S198, 2001.
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. A. Bravo, Antonelli, A., Bacon, C. D., Bartoszek, K., Blom, M. P. K., Huynh, S., Jones, G., Knowles, L. L., Lamichhaney, S., Marcussen, T., Morlon, H., Nakhleh, L., Oxelman, B., Pfeil, B., Schliep, A., Wahlberg, N., Werneck, F. P., Wiedenhoeft, J., .Willows-Munro, S., and Edwards, S. V., “Embracing heterogeneity: coalescing the Tree of Life and the future of phylogenomics”, PeerJ, vol. 7, p. e6399, 2019.PDF icon PeerJ2019.pdf (3.72 MB)
Y. Yu, Jermaine, C., and Nakhleh, L., “Exploring phylogenetic hypotheses via Gibbs sampling on evolutionary networks”, BMC Genomics, vol. 17, no. Suppl 10, p. 784, 2016.PDF icon YuJermaineNakhleh-BMCGenomics2016.pdf (965.19 KB)
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.
E. Bapteste, van Iersel, L., Janke, A., Kelchner, S., Kelk, S., McInerney, J. O., Morrison, D. A., Nakhleh, L., Steel, M., Stougie, L., and Whitfield, J., “Networks: Expanding evolutionary thinking”, Trends in Genetics, vol. 29, no. 8, pp. 439-441, 2013.PDF icon TIG2013.pdf (179.16 KB)
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.