Alekseyev

Max Alekseyev


Assistant Professor


University of South Carolina

Dr. Alekseyev's research interests range from discrete mathematics (e.g., combinatorics and graph theory) to bioinformatics (e.g., comparative genomics). He views the ultimate goal to be development and application of new methods of discrete mathematics to solve open biological problems that have recently emerged. A particular area of interest are genome rearrangements representing the evolutionary events that change chromosomal architectures. While genome rearrangement analysis is a powerful tool for studying both chromosome evolution and chromosomal abnormalities in cancer, it has certain limitations. In his research Dr. Alekseyev develops new algorithms and extends existing ones to more complex cases (e.g., genomes with duplicated genes or rearrangement scenarios involving transpositions) as well as explores new biological applications (e.g., rearrangement hotspots analysis).

Education

  • Ph. D., Computer Science, University of California, San Diego (2007)
  • M. S., Mathematics, Nizhni Novgorod State University, (1999)
  • B.S., Mathematics, Nizhni Novgorod State University (1997)

Selected Publications

  • Max A. Alekseyev and Pavel A. Pevzner "Breakpoint Graphs and Ancestral Genome Reconstructions". Genome Research (2009). accepted. 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
  • 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.
Max Alekseyev

Phone: 803.777.5310
Fax: 803.777.3767
maxal@cec.sc.edu


3A48 Swearingen Computer Science & Engineering University of South Carolina 315 Main St. Columbia, SC 29208
SC US