|
|
|
 |
Max Alekseyev's
|
|
Contact Info Teaching Research Publications Resume Personal Interests |
Son Pham, Dmitry Antipov, Alexander Sirotkin, Glenn Tesler, Pavel Pevzner and Max Alekseyev "PATH-SETS: A Novel Approach for Comprehensive Utilization of Mate-Pairs in Genome Assembly". The 16th Annual Conference on Research in Computational Molecular Biology (RECOMB), 2012. (to appear)
Max A. Alekseyev and Frank Ruskey "Problem 11544". American Mathematical Monthly, 118(1) (2011), p. 84. doi:10.4169/amer.math.monthly.118.01.084
Shuai Jiang and Max A. Alekseyev "Weighted genomic distance can hardly impose a bound on the proportion of transpositions". Lecture Notes in Computer Science 6577 (2011), pp. 124-133. doi:10.1007/978-3-642-20036-6_13
Max A. Alekseyev "On the intersections of Fibonacci, Pell, and Lucas numbers". INTEGERS 11(3) (2011), pp. 239-259. doi:10.1515/INTEG.2011.021
Max A. Alekseyev and Pavel A. Pevzner "Limited Lifespan of Fragile Regions in Mammalian Evolution". Lecture Notes in Computer Science 6398 (2011), pp. 198-215. doi:10.1007/978-3-642-16181-0_17
Max A. Alekseyev "On the number of two-dimensional threshold functions". SIAM Journal on Discrete Mathematics 24(4) (2010), pp. 1617-1631. doi:10.1137/090750184
Max A. Alekseyev and Pavel A. Pevzner "Comparative Genomics Reveals Birth and Death of Fragile Regions in Mammalian Evolution". Genome Biology 11(11) (2010), R117. doi:10.1186/gb-2010-11-11-r117
Qian Peng, Max Alekseyev, Glenn Tesler, and Pavel Pevzner "Decoding the Genomic Architecture of Mammalian and Plant Genomes: Synteny Blocks and Large-Scale Duplications". Communications in Information and Systems 10(1) (2010), pp. 1-22.
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 Circular to Linear 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 Circular to Linear Genomes". Lecture Notes in Computer Science 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.
Max Alekseyev and Emeric Deutsch "Problem 11281". American Mathematical Monthly 114(3) (2007), p. 259. (Solution 11281, AMM 116(5) (2009), p. 465)
Max A. Alekseyev and Pavel A. Pevzner "Genome Halving Problem Revisited". Lecture Notes in Computer Science 3328 (2005), pp. 1-15. doi:10.1007/978-3-540-30538-5_1
Max Alekseyev and Pavel Pevzner "Genome Halving Problem". Theses on IMA/RECOMB Satellite Workshop on Comparative Genomics, 2003.
Steffen Heber, Max Alekseyev, Sing-Hoi Sze, Haixu Tang, and Pavel A. Pevzner "Splicing Graphs and EST Assembly Problem". Bioinformatics 18 (2002), pp. S181-S188. doi:10.1093/bioinformatics/18.suppl_1.S181
M. A. Alekseev, L. Yu. Glebskii, and E. I. Gordon "On Approximation of Groups, Group Actions, and Hopf Algebras". Journal of Mathematical Sciences 107 (5), 2001, pp. 4305-4332. doi:10.1023/A:1012485910692
M. A. Alekseev and E. I. Gordon "On actions of aproximable groups in the ultraproducts of measurable spaces". Theses in International Conference Dedicated to the 90th Anniversary of L.S.Pontryagin, Moscow, 1998.
Max Alekseyev "Josephus Problem". The Empire of Mathematics 2 (2001), pp. 22-28. (available in Russian)
Max Alekseyev "On matrices with pairwise distinct rows and columns". Proceeding of the 4th Workshop On Discrete Mathematics And Its Applications, Moscow, 2000. (in Russian)
Max Alekseyev. "Realization of linear programming algorithms in finite extensions of field Q". Workshop on Mathematics and Computer Science, Sarov, 2000. (in Russian)