E-mail: maxal@cse.sc.edu
Phone:  (803) 777-5310
FAX:    (803) 777-3767
Office: Swearingen 3A48

Mailing address:
Department of Computer Science & Engineering
University of South Carolina
301 Main St., Columbia, SC 29208

Research Interests: Computational Molecular Biology / Bioinformatics, Comparative Genomics, Graph Theory, Combinatorics, Discrete Algorithms, Cryptography.

Brief Biography:

• Ph.D. in Computer Science, University of California San Diego, 2001-2007
• Lecturer and Researcher, Computational Mathematics & Cybernetics, Nizhni Novgorod State University, 1999-2001
• M.S. in Mathematics (summa cum laude), Nizhni Novgorod State University, 1997-1999
• B.S. in Mathematics (summa cum laude), Nizhni Novgorod State University, 1993-1997

Recent publications (see Publications page for the complete list):

Max Alekseyev, Pavel Pevzner "Where are fragile regions in the human genome?". submitted.

Qian Peng, Max Alekseyev, Glenn Tesler, and Pavel Pevzner "Synteny Block Construction for Genomes with Large Duplications". submitted.

Qian Peng, Max Alekseyev, Glenn Tesler, and Pavel Pevzner "Decoding Synteny Blocks and Large-Scale Duplications in Mammalian and Plant Genomes". Lecture Notes in Computer Science 5724 (2009), pp. 220-232. DOI: 10.1007/978-3-642-04241-6_19

Max A. Alekseyev "Gene Duplications and Genome Rearrangements". VDM Verlag Dr. Müller, 2009. ISBN: 978-3-639-13615-9

Max A. Alekseyev and Pavel A. Pevzner "Breakpoint Graphs and Ancestral Genome Reconstructions". Genome Research 19(5) (2009), pp. 943-957. DOI: 10.1101/gr.082784.108

Max A. Alekseyev "Multi-Break Rearrangements and Breakpoint Re-uses: from Linear to Circular Genomes". Journal of Computational Biology 15(8) (2008), pp. 1117-1131. DOI: 10.1089/cmb.2008.0080

Max A. Alekseyev and Pavel A. Pevzner "Multi-Break Rearrangements and Chromosomal Evolution". Theoretical Computer Science 395(2-3) (2008), pp. 193-202. DOI: 10.1016/j.tcs.2008.01.013

Max A. Alekseyev and Pavel A. Pevzner "Are There Rearrangement Hotspots in the Human Genome?". PLoS Computational Biology 3(11) (2007): e209. DOI: 10.1371/journal.pcbi.0030209 (fulltext at PubMed Central)

Max A. Alekseyev "Multi-Break Rearrangements: from Linear to Circular Genomes". Lecture Notes in Bioinformatics 4751 (2007), pp. 1-15. DOI: 10.1007/978-3-540-74960-8_1

Max A. Alekseyev and Pavel A. Pevzner "Whole Genome Duplications and Contracted Breakpoint Graphs". SIAM Journal on Computing, 36(6) (2007), pp. 1748-1763. DOI: 10.1137/05064727X

Max A. Alekseyev and Pavel A. Pevzner "Colored de Bruijn Graphs and the Genome Halving Problem". IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4 (2007), pp. 98-107. DOI: 10.1109/TCBB.2007.1002

Max A. Alekseyev and Pavel A. Pevzner "Whole Genome Duplications, Multi-Break Rearrangements, and Genome Halving Theorem". Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2007), pp. 665-679.