Publications

Sort by: Author 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

J

Jaitly, D., P. Kearney, G. Lin, and B. Ma, "Methods for Reconstructing the History of Tandem Repeats and their Application to the Human Genome", Invited paper, Journal of Computer and System Sciences 65(3): 494-507, 2002.
Jameson, E., A.C. Doxey, R. Airs, K.J. Purdy, J.C. Murrell, and Y. Chen, "Metagenomic datamining reveals contrasting microbial populations responsible for trimethylamine formation in human gut and marine ecosystems", Microbial Genomics. 2(9). (DOI 10.1099/mgen.0.000080), 2016.
Jang, R., X. Gao, and M. Li, "Towards automated structure-based assignment", RECOMB 2010, pp. 189-207. Lisbon, Portugal, vol. April 25-28 2010, 2010.
Jang, R., X. Gao, and M. Li, " Towards fully automated structure-based NMR assignment of 15N-labeled proteins from automatically picked peaks", Special Issue for RECOMB 2010, J. Comput. Biol.,18:3, 374-363, 2011.
Jiang, T., and M. Li, "Shortest common superstring", Chapter 8 in Pattern matching algorithms, pp. 237-266, 1997.
Jiang, T., and M. Li, "Optimization problems in molecular biology", In Advances in Optimization and Approximation, edited by D.Z. Du and J. Sun, Kluwer Academic Publishers, pp. 195-216, 1994.
Jiang, T., G. Lin, B. Ma, and K. Zhang, " The Longest Common Subsequence Problem for Arc-Annotated Sequences", The 11th Symposium on Combinatorial Pattern Matching. 154-165, 2000.
Jiang, T., P. Kearney, and M. Li, "Orchestrating quartets: approximation and data correction", Proc. 39th IEEE Symp. Foundation of Computer Science (FOCS'98), Palo Alto, California, pp. 416-425, 1998.
Jiang, T., and M. Li, "On the approximation of shortest common supersequences and longest common subsequences", Proc. 21st International Colloquium on Automata, Languages, and Programming (ICALP'94), pp. 191-202, 1994.
Jiang, T., and M. Li, "Approximating shortest superstrings with constraints", Proc. 3rd Workshop on Algorithms and Data Structures (WAD'93), Montreal, pp. 385-396, 1993.
Jiang, T., and M. Li, "On the complexity of learning strings and sequences", Proc. 4th ACM Conf. Computational Learning Theory (COLT'91), Santa Cruz., pp. 367-274, 1991.
Jiang, T., G. Lin, B. Ma, and K. Zhang, " The Longest Common Subsequence Problem for Arc-Annotated Sequences", Journal of Discrete Algorithms 2(2): 257-270, 2004.
Jiang, T., G. Lin, B. Ma, and K. Zhang, "A General Edit Distance between Two RNA Structures", Journal of Computational Biology 9(2): 371-388, 2002.
Jiang, T., P. Kearney, and M. Li, "A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application", SIAM J. Computing, 30:6, 1942-1961, 2001.
Jiang, T., P. Kearney, and M. Li, "Some open questions in computational molecular biology", Journal of Algorithms, 34:1(2000), 194-201; and SIGACT News, 30:3, 43-49, 1999.
Jiang, T., and M. Li, "DNA sequencing and string learning", Math. Syst. Theory, 29, 387-405, 1996.
Jiang, T., and M. Li, "On the approximation of shortest common supersequences and longest common subsequences", SIAM J. Comput., 24:5, 1122-1139, 1995.
Jiang, T., and M. Li, "Approximating shortest superstrings with constraints", Theoret. Comput. Sci., 134, 473-491, 1994.
Jiang, T., and M. Li, "On the complexity of learning strings and sequences", Theoretical Computer Science, 119, 363-371, 1993.
Jiang, T., M. Li, and D. Du, "A note on shortest common superstrings with flipping", Inform. Process. Lett., 44:4, 195-199, 1992.
Jiao, Y.S., M. Li, and J.Y. Xu, "On the k-Closest Substring and k-Consensus Pattern problems", CPM'04, Istanbul, Turkey, 2004.
Johnston, C., M. Skinnider, M. Wyatt, X. Li, L. Yang, D. Zechel, B. Ma, and N. Magarvey, "An Automated Genomes-to-Natural Products Platform (GNP)", Nature Communications. DOI: 10.1038/ncomms9421, 2015.

Publications search