Individual Listing

EBU2
University of California
Riverside, CA 92521

Lonardi, Stefano

Associate Professor

Bourns College of Engineering

Computer Science & Engineering


Biography

Stefano Lonardi’s research areas include bioinformatics and data compression. He is also interested in data mining, algorithm design and analysis and scientific visualization. His previous work experience includes research and teaching assistantships at Purdue, and an internship at Celera Genomics in Rockville, Maryland. Dr. Lonardi is a member of ACM, IEEE, Upsilon Pi Upsilon and Phi Kappa Phi honor societies, and the International Society for Computational Biology.

Former Institution

Department of Computer Science, Purdue University

Degrees

Laurea Computer Science 1994

Università di Pisa

Dottorato Electrical and Computer Engineering 1999

Università di Padova

Ph.D. Computer Science 2001

Purdue University

Awards

•April 2000: Graduate Student Research Award, Purdue University
•August 2005: CAREER Award, NSF Science and Engineering Information Integration and Informatics


Research Area

Computational molecular biology, data mining, data compression

Publications

• N.G.Portney, Y.Wu, L.K.Quezada, S.Lonardi, M.Ozkan, "Length-based Encoding of Binary Data in DNA", Langmuir, 24(5):1631-1616, 2008.

• Y.Wu, L.Liu, T.Close, S.Lonardi, "Deconvoluting BAC-gene relationships using a physical map", Journal of Bioinformatics and Computational Biology, 6(3), 2008.

• H. Jin, V. Vacic, T. Girke, S. Lonardi, J.-K. Zhu, "Small RNAs and the regulation of cis-natural antisense transcripts in Arabidopsis.", BMC Molecular Biology, (9)6, 2007.

• Y.Wu, L.Liu, T.Close, S.Lonardi, "Deconvoluting BAC-gene relationships using a physical map", Journal of Bioinformatics and Computational Biology, 6(3), 2008.

• S. Lonardi, W. Szpankowski, M. D. Ward, “Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments”, IEEE Transactions on Information Theory, 53(5):1799-1813, 2007.

• S. Lonardi, W. Szpankowski, Q. Yang, “Finding biclusters by random projections.”, Theoretical Computer Science, 368(3): 217-230, 2006.

• X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi, T. Jiang, “Assignment of orthologous genes via genome rearrangement”, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2(4):302-315, 2005.

• J.Zheng, T.Close, T.Jiang, S.Lonardi, “Efficient selection of unique and popular oligos for large EST databases”, Bioinformatics, 20(13):2101-2112, 2004.

• Apostolico, M. E. Bock, S. Lonardi, “Monotony of surprise and large-scale quest for unusual words”, Journal of Computational Biology, 10(2/3):283-311, 2003.

• E. W. Myers, G. G. Sutton, A. L. Delcher, I. M. Dew, D. P. Fasulo, M. J. Flanigan, S. A. Kravitz, C. M. Mobarry, K. H. J. Reinert, K. A. Remington, E. L. Anson, R. A. Bolanos, H.-H. Chou, C. M. Jordan, A. L. Halpern, S. Lonardi, E. M. Beasley, R. C. Brandon, L. Chen, P. J. Dunn, Z. Lai, Y. Liang, D. R. Nusskern, M. Zhan, Q. Zhang, X. Zheng, G. M. Rubin, M. D. Adams, J. C. Venter, “A whole-genome assembly of drosophila”, Science, 287(5461):2196-2204, 2000.

For additional information, please see Professor Lonardi's faculty webpage.

http://www.cs.ucr.edu/~stelo