default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMax A. Alekseyev
Person information
- affiliation: George Washington University, Computational Biology Institute, Ashburn, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Max A. Alekseyev
:
Enumeration of Payphone Permutations. Am. Math. Mon. 131(6): 491-500 (2024)- [c27]Arda Aydin, Max A. Alekseyev, Alexander Barg:
A Family of Permutationally Invariant Quantum Codes. ISIT 2024: 2706-2711 - [c26]Max A. Alekseyev:
On Computing Sets of Integers with Maximum Number of Pairs Summing to Powers of 2. IWOCA 2024: 1-13 - 2023
- [i15]Max A. Alekseyev:
On computing sets of integers with maximum number of pairs summing to powers of 2. CoRR abs/2303.02872 (2023) - [i14]Arda Aydin, Max A. Alekseyev, Alexander Barg:
A family of permutationally invariant quantum codes. CoRR abs/2310.05358 (2023) - 2022
- [j28]Sergey Aganezov, Pavel Avdeyev, Nikita Alexeev, Yongwu Rong, Max A. Alekseyev:
Orienting Ordered Scaffolds: Complexity and Algorithms. SN Comput. Sci. 3(4): 308 (2022) - 2020
- [j27]Pavel Avdeyev, Nikita Alexeev, Yongwu Rong, Max A. Alekseyev:
A unified ILP framework for core ancestral genome reconstruction problems. Bioinform. 36(10): 2993-3003 (2020) - [j26]Max A. Alekseyev, José María Grau, Antonio M. Oller-Marcén:
Computing solutions to the congruence 1n+2n+⋯+nn≡p(modn). Discret. Appl. Math. 286: 3-9 (2020) - [c25]Pavel Avdeyev, Max A. Alekseyev:
Linearization of Ancestral Genomes with Duplicated Genes. BCB 2020: 53:1-53:10 - [e1]George Bebis, Max A. Alekseyev, Heyrim Cho, Jana Gevertz, María Rodríguez Martínez:
Mathematical and Computational Oncology - Second International Symposium, ISMCO 2020, San Diego, CA, USA, October 8-10, 2020, Proceedings. Lecture Notes in Computer Science 12508, Springer 2020, ISBN 978-3-030-64510-6 [contents]
2010 – 2019
- 2019
- [c24]Pavel Avdeyev, Maria Atamanova, Max A. Alekseyev:
A Uniform Theory of Adequate Subgraphs for the Genome Median, Halving, and Aliquoting Problems. AlCoB 2019: 97-111 - [i13]Sergey Aganezov, Pavel Avdeyev, Nikita Alexeev, Yongwu Rong, Max A. Alekseyev:
Orienting Ordered Scaffolds: Complexity and Algorithms. CoRR abs/1911.11190 (2019) - 2018
- [j25]Nikita Alexeev, Max A. Alekseyev:
Combinatorial Scoring of Phylogenetic Trees and Networks Based on Homoplasy-Free Characters. J. Comput. Biol. 25(11): 1203-1219 (2018) - [c23]Anton Nekhai, Maria Atamanova, Pavel Avdeyev, Max A. Alekseyev:
A Rapid Exact Solution for the Guided Genome Halving Problem. BCB 2018: 550 - [c22]Pavel Avdeyev, Shuai Jiang, Max A. Alekseyev:
Implicit Transpositions in DCJ Scenarios. BCB 2018: 571 - [i12]Max A. Alekseyev:
On partitions into squares of distinct integers whose reciprocals sum to 1. CoRR abs/1801.05928 (2018) - 2017
- [j24]Sergey Aganezov Jr., Max A. Alekseyev:
CAMSA: a tool for comparative analysis and merging of scaffold assemblies. BMC Bioinform. 18(15): 41-50 (2017) - [j23]Nikita Alexeev, Anna Pologova, Max A. Alekseyev:
Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs. J. Comput. Biol. 24(2): 93-105 (2017) - [c21]Sergey Aganezov Jr., Max A. Alekseyev:
On problem of orienting ordered scaffolds. ICCABS 2017: 1 - [c20]Pavel Avdeyev, Nikita Alexeev, Yongwu Rong, Max A. Alekseyev:
A Unified ILP Framework for Genome Median, Halving, and Aliquoting Problems Under DCJ. RECOMB-CG 2017: 156-178 - [c19]Sergey Aganezov Jr., Max A. Alekseyev:
Orientation of Ordered Scaffolds. RECOMB-CG 2017: 179-196 - 2016
- [j22]Nikita Alexeev, Pavel Avdeyev, Max A. Alekseyev:
Comparative genomics meets topology: a novel view on genome median and halving problems. BMC Bioinform. 17(S-14): 213-223 (2016) - [j21]Yu-Chen Liu, Sheng-Da Hsu, Chih-Hung Chou, Wei-Yun Huang, Yu-Hung Chen, Chia-Yu Liu, Guan-Jay Lyu, Shao-Zhen Huang, Sergey Aganezov Jr., Max A. Alekseyev, Chung-Der Hsiao, Hsien-Da Huang:
Transcriptome sequencing based annotation and homologous evidence based scaffolding of Anguilla japonica draft genome. BMC Genom. 17(S-1): 13 (2016) - [j20]Pavel Avdeyev, Shuai Jiang, Sergey Aganezov Jr., Fei Hu, Max A. Alekseyev:
Reconstruction of Ancestral Genomes in Presence of Gene Gain and Loss. J. Comput. Biol. 23(3): 150-164 (2016) - [j19]Max A. Alekseyev:
Computing the Inverses, their Power Sums, and Extrema for Euler's Totient and Other Multiplicative Functions. J. Integer Seq. 19(5): 16.5.2 (2016) - [c18]Nikita Alexeev, Max A. Alekseyev:
Combinatorial Scoring of Phylogenetic Networks. COCOON 2016: 560-572 - [c17]Sergey Aganezov Jr., Max A. Alekseyev:
CAMSA: A tool for comparative analysis and merging of scaffold assemblies. ICCABS 2016: 1 - [c16]Sergey Aganezov Jr., Max A. Alekseyev:
Multi-genome Scaffold Co-assembly Based on the Analysis of Gene Orders and Genomic Repeats. ISBRA 2016: 237-249 - [c15]Max A. Alekseyev:
Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations. IWOCA 2016: 151-162 - [i11]Max A. Alekseyev, Gerard P. Michon:
Making Walks Count: From Silent Circles to Hamiltonian Cycles. CoRR abs/1602.01396 (2016) - [i10]Nikita Alexeev, Max A. Alekseyev:
Combinatorial Scoring of Phylogenetic Networks. CoRR abs/1602.02841 (2016) - 2015
- [j18]Sergey Aganezov Jr., Nadia Sitdykova, Max A. Alekseyev:
Scaffold assembly based on genome rearrangement analysis. Comput. Biol. Chem. 57: 46-53 (2015) - [j17]Max A. Alekseyev, Marina G. Basova, Nikolai Yu. Zolotykh:
On the Minimal Teaching Sets of Two-Dimensional Threshold Functions. SIAM J. Discret. Math. 29(1): 157-165 (2015) - [c14]Nikita Alexeev, Anna Pologova, Max A. Alekseyev:
Generalized Hultman Numbers and the Distribution of Multi-break Distances. AlCoB 2015: 3-12 - [c13]Shuai Jiang, Max A. Alekseyev:
Implicit Transpositions in Shortest DCJ Scenarios. AlCoB 2015: 13-24 - [c12]Nikita Alexeev, Max A. Alekseyev:
Estimation of the true evolutionary distance under the fragile breakage model. ICCABS 2015: 1 - [c11]Nikita Alexeev, Rustem Aidagulov, Max A. Alekseyev:
A Computational Method for the Rate Estimation of Evolutionary Transpositions. IWBBIO (1) 2015: 471-480 - [i9]Max A. Alekseyev:
Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations. CoRR abs/1510.07926 (2015) - 2014
- [j16]Max A. Alekseyev, Szabolcs Tengely:
On Integral Points on Biquadratic Curves and Near-Multiples of Squares in Lucas Sequences. J. Integer Seq. 17(6): 14.6.6 (2014) - [c10]Shuai Jiang, Max A. Alekseyev:
Linearization of Median Genomes under DCJ. WABI 2014: 97-106 - [i8]Max A. Alekseyev:
Computing the (number of) inverses of Euler's totient and other multiplicative functions. CoRR abs/1401.6054 (2014) - 2013
- [j15]Sergey I. Nikolenko, Anton I. Korobeynikov, Max A. Alekseyev:
BayesHammer: Bayesian clustering for error correction in single-cell sequencing. BMC Genom. 14(S-1): S7 (2013) - [j14]Son K. Pham, Dmitry Antipov, Alexander Sirotkin, Glenn Tesler, Pavel A. Pevzner, Max A. Alekseyev:
Pathset Graphs: A Novel Approach for Comprehensive Utilization of Paired Reads in Genome Assembly. J. Comput. Biol. 20(4): 359-371 (2013) - [j13]Sergey Nurk, Anton Bankevich, Dmitry Antipov, Alexey A. Gurevich, Anton I. Korobeynikov, Alla L. Lapidus, Andrey D. Prjibelski, Alex Pyshkin, Alexander Sirotkin, Yakov Sirotkin, Ramunas Stepanauskas, Scott R. Clingenpeel, Tanja Woyke, Jeffrey S. McLean, Roger Lasken, Glenn Tesler, Max A. Alekseyev, Pavel A. Pevzner:
Assembling Single-Cell Genomes and Mini-Metagenomes From Chimeric MDA Products. J. Comput. Biol. 20(10): 714-737 (2013) - [c9]Sergey Nurk, Anton Bankevich, Dmitry Antipov, Alexey A. Gurevich, Anton I. Korobeynikov, Alla L. Lapidus, Andrey D. Prjibelsky, Alex Pyshkin, Alexander Sirotkin, Yakov Sirotkin, Ramunas Stepanauskas, Jeffrey S. McLean, Roger Lasken, Scott R. Clingenpeel, Tanja Woyke, Glenn Tesler, Max A. Alekseyev, Pavel A. Pevzner:
Assembling Genomes and Mini-metagenomes from Highly Chimeric Reads. RECOMB 2013: 158-170 - [i7]Max A. Alekseyev, Toby Berger:
Solving the Tower of Hanoi with Random Moves. CoRR abs/1304.3780 (2013) - [i6]Max A. Alekseyev:
On integral points on biquadratic curves and near multiples of squares in Lucas sequences. CoRR abs/1306.0883 (2013) - [i5]Max A. Alekseyev, Marina G. Basova, Nikolai Yu. Zolotykh:
The average cardinality of the minimal teaching set of a threshold function on a two-dimensional rectangular grid. CoRR abs/1307.1058 (2013) - 2012
- [j12]Sergey Aganezov Jr., Max A. Alekseyev:
On pairwise distances and median score of three genomes under DCJ. BMC Bioinform. 13(S-19): S1 (2012) - [j11]Anton Bankevich, Sergey Nurk, Dmitry Antipov, Alexey A. Gurevich, Mikhail Dvorkin, Alexander S. Kulikov, Valery M. Lesin, Sergey I. Nikolenko, Son K. Pham, Andrey D. Prjibelski, Alex Pyshkin, Alexander Sirotkin, Nikolay Vyahhi, Glenn Tesler, Max A. Alekseyev, Pavel A. Pevzner:
SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing. J. Comput. Biol. 19(5): 455-477 (2012) - [c8]Son K. Pham, Dmitry Antipov, Alexander Sirotkin, Glenn Tesler, Pavel A. Pevzner, Max A. Alekseyev:
Pathset Graphs: A Novel Approach for Comprehensive Utilization of Paired Reads in Genome Assembly. RECOMB 2012: 200-212 - [i4]Sergey Aganezov Jr., Max A. Alekseyev:
On pairwise distances and median score of three genomes under DCJ. CoRR abs/1208.0133 (2012) - [i3]Sergey I. Nikolenko, Anton I. Korobeynikov, Max A. Alekseyev:
BayesHammer: Bayesian clustering for error correction in single-cell sequencing. CoRR abs/1211.2756 (2012) - 2011
- [j10]Max A. Alekseyev:
On the Intersections of Fibonacci, Pell, and Lucas Numbers. Integers 11A: Article1 (2011) - [c7]Shuai Jiang, Max A. Alekseyev:
Weighted Genomic Distance Can Hardly Impose a Bound on the Proportion of Transpositions. RECOMB 2011: 124-133 - 2010
- [j9]Max A. Alekseyev, Qian Peng, Pavel A. Pevzner, Glenn Tesler:
Decoding the Genomic Architecture of Mammalian and Plant Genomes: Synteny Blocks and Large-scale Duplications. Commun. Inf. Syst. 10(1): 1-22 (2010) - [j8]Max A. Alekseyev:
On the Number of Two-Dimensional Threshold Functions. SIAM J. Discret. Math. 24(4): 1617-1631 (2010) - [c6]Max A. Alekseyev, Pavel A. Pevzner:
Limited Lifespan of Fragile Regions in Mammalian Evolution. RECOMB-CG 2010: 198-215 - [i2]Max A. Alekseyev:
On the intersections of Fibonacci, Pell, and Lucas numbers. CoRR abs/1002.1679 (2010) - [i1]Shuai Jiang, Max A. Alekseyev:
Weighted genomic distance can hardly impose a bound on the proportion of transpositions. CoRR abs/1012.2422 (2010)
2000 – 2009
- 2009
- [j7]Max A. Alekseyev, John Henry Steelman:
Counting Permutations with Two Displacement Values: 11281 [2007, 259]. Am. Math. Mon. 116(5): 465 (2009) - [c5]Qian Peng, Max A. Alekseyev, Glenn Tesler, Pavel A. Pevzner:
Decoding Synteny Blocks and Large-Scale Duplications in Mammalian and Plant Genomes. WABI 2009: 220-232 - 2008
- [j6]Max A. Alekseyev:
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes. J. Comput. Biol. 15(8): 1117-1131 (2008) - [j5]Max A. Alekseyev, Pavel A. Pevzner:
Multi-break rearrangements and chromosomal evolution. Theor. Comput. Sci. 395(2-3): 193-202 (2008) - 2007
- [j4]Max A. Alekseyev, Pavel A. Pevzner:
Are There Rearrangement Hotspots in the Human Genome? PLoS Comput. Biol. 3(11) (2007) - [j3]Max A. Alekseyev, Pavel A. Pevzner:
Whole Genome Duplications and Contracted Breakpoint Graphs. SIAM J. Comput. 36(6): 1748-1763 (2007) - [j2]Max A. Alekseyev, Emeric Deutsch:
Problem 11281. Am. Math. Mon. 114(3): 259 (2007) - [j1]Max A. Alekseyev, Pavel A. Pevzner:
Colored de Bruijn Graphs and the Genome Halving Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 4(1): 98-107 (2007) - [c4]Max A. Alekseyev:
Multi-break Rearrangements: From Circular to Linear Genomes. RECOMB-CG 2007: 1-15 - [c3]Max A. Alekseyev, Pavel A. Pevzner:
Whole genome duplications, multi-break rearrangements, and genome halving problem. SODA 2007: 665-679 - 2004
- [c2]Max A. Alekseyev, Pavel A. Pevzner:
Genome Halving Problem Revisited. FSTTCS 2004: 1-15 - 2002
- [c1]Steffen Heber, Max A. Alekseyev, Sing-Hoi Sze, Haixu Tang, Pavel A. Pevzner:
Splicing graphs and EST assembly problem. ISMB 2002: 181-188
Coauthor Index
aka: Sergey Aganezov
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-12 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
