Max Alekseyev's
|
Research Activities Publications Resume Personal Interests |

E-mail: maxal@cs.ucsd.edu
Phone: (858) 534-5932
FAX: (858) 534-7029
Office: CSE 3222
Mailing address:
Department of Computer Science & Engineering
University of California, San Diego
9500 Gilman Dr., La Jolla, CA 92093-0404
Brief
Biography:
Research Interests: Computational Molecular Biology / Bioinformatics, Comparative Genomics, Graph Theory, Combinatorics, Discrete Algorithms, Cryptography.
Recent publications (see Publications page for the complete list):
Max A. Alekseyev and Pavel A. Pevzner "Breakpoint Graphs and Ancestral Genome Reconstructions". submitted.
Qian Peng, Max Alekseyev, Glenn Tesler, and Pavel Pevzner "Synteny Block Construction for Genomes with Large Duplications". submitted.
Max A. Alekseyev "Multi-Break Rearrangements and Breakpoint Re-uses: from Linear to Circular Genomes". Journal of Computational Biology (2008), in press. (preprint)
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.