معرفی
Max Alekseyev is an Associate Professor in the Mathematics Department and Computational Biology Institute. His research spans computational graph theory, enumerative combinatorics, computational/algorithmic biology, and comparative genomics. He focuses on interdisciplinary problems, blending mathematics with biological applications, particularly in genome assembly and analysis.
His work includes advancements in genome scaffolding algorithms, combinatorial sequence analysis, and mathematical biology. Notable contributions involve genome assembly tools like CAMSA and studies on ancestral genome reconstruction. He also explores theoretical topics such as Bernoulli series generalizations and modular data classification.
His research trends highlight a blend of pure mathematics (e.g., number theory, graph theory) and applied computational methods, addressing challenges in genomics and evolutionary biology. He secured an NSF Student Travel Grant in 2018 for computational molecular biology.
