The following pages link to Max A. Alekseyev (Q932314):
Displaying 29 items.
- Multi-break rearrangements and chromosomal evolution (Q932316) (← links)
- Decoding the genomic architecture of mammalian and plant genomes: synteny blocks and large-scale duplications (Q966191) (← links)
- (Q1743267) (redirect page) (← links)
- (Q211998) (redirect page) (← links)
- (Q1991547) (redirect page) (← links)
- On encoding polynomials for strong algebraic manipulation detection codes (Q1743268) (← links)
- On \(p\)-adic approximation of sums of binomial coefficients (Q1991548) (← links)
- Computing solutions to the congruence \(1^n + 2^n + \ldots + n^n \equiv p \pmod n\) (Q2201763) (← links)
- A uniform theory of adequate subgraphs for the genome median, halving, and aliquoting problems (Q2315506) (← links)
- Computing the inverses, their power sums, and extrema for Euler's totient and other multiplicative functions (Q2808585) (← links)
- Combinatorial Scoring of Phylogenetic Networks (Q2817897) (← links)
- Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations (Q2819499) (← links)
- On integral points on biquadratic curves and near-multiples of squares in Lucas sequences (Q2877895) (← links)
- (Q2934652) (← links)
- On the Number of Two-Dimensional Threshold Functions (Q3013151) (← links)
- On the Intersections of Fibonacci, Pell, and Lucas Numbers (Q3015019) (← links)
- On the Minimal Teaching Sets of Two-Dimensional Threshold Functions (Q3453571) (← links)
- (Q4449412) (← links)
- On Enumeration of Dyck--Schr\"oder Paths (Q4559885) (← links)
- Whole Genome Duplications and Contracted Breakpoint Graphs (Q5432370) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465844) (← links)
- Three Cousins of Recaman's Sequence (Q5868563) (← links)
- On approximations of groups, group actions, and Hopf algebras. (Q5947530) (← links)
- Solving the Tower of Hanoi with Random Moves (Q6241120) (← links)
- Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs (Q6260062) (← links)
- Estimation of the True Evolutionary Distance under the Fragile Breakage Model (Q6266827) (← links)
- Making Walks Count: From Silent Circles to Hamiltonian Cycles (Q6270089) (← links)
- On partitions into squares of distinct integers whose reciprocals sum to 1 (Q6296625) (← links)
- Classification of integral modular data up to rank 13 (Q6508675) (← links)
- Enumeration of Payphone Permutations (Q6509585) (← links)
- Enumeration of Payphone Permutations (Q6554391) (← links)
