An exact quadratic algorithm for the shortest tree transformation.
Doklady Mathematics, Oct 29 2024, Vol. 110, Iss. 2, P. 373–378.
DOI: 10.1134/S1064562424702259 Go to publication
Algorithms for the reconstruction of genomic structures with proofs of their low polynomial complexity and high exactness.
Mathematics, Mar 11 2024, Vol. 12, No. 6, Art. 817.
DOI: 10.3390/math12060817
(WoS Q1) Go to publication
Constructing an evolutionary tree and path–cycle graph evolution along it.
Mathematics, Apr 24 2023, Vol. 11, No. 9, Art. 2024.
DOI: 10.3390/math11092024
(WoS Q1) Go to publication
Reconstruction of evolution of genome structures with paralogs.
The proceedings of International congress «Biotechnology: state of the art and perspectives»,
Moscow, Russia, October 26–29 2021, Iss. 19, P. 208–209.
DOI: 10.37747/2312-640X-2021-19-207-209 Go to publication
Multiplicatively exact algorithms for transformation and reconstruction of directed path-cycle graphs with repeated edges.
Mathematics, Oct 14 2021, Vol. 9, No. 20, Art. 2576.
DOI: 10.3390/math9202576 (WoS Q1) Go to publication
Linear time additively exact algorithm for transformation of chain-cycle graphs for arbitrary costs of deletions and insertions.
Mathematics,
Vol. 8, No. 11, Art. 2001.
DOI: 10.3390/math8112001
(WoS Q1) Go to publication
Evolution of mitochondrial genomic structures in metazoans: algorithm and software.
The proceedings of International forum «Biotechnology: state of the art and perspectives»,
Moscow, Russia, October 28–30 2020, Iss. 18, P. 261–262.
DOI: 10.37747/2312-640X-2020-18-260-262 Go to publication
An almost exact linear algorithm for transformation of chain-cycle graphs with optimization of the sum of operation costs.
Doklady Mathematics,
2020, Vol. 102, No. 2, P. 376–379.
DOI: 10.1134/S1064562420050324 Go to publication
An almost exact linear complexity algorithm of the shortest transformation of chain-cycle graphs.
arXiv:2004.14351 [math.CO], Apr 29 2020. Go to publication
Linear algorithm for reconstruction of chromosome structures.
The proceedings of International congress «Biotechnology: state of the art and perspectives»,
Moscow, Russia, February 25–27 2019, Iss. 17, P. 350–351. Go to publication
A linear algorithm for restructuring a graph.
Automation and Remote Control,
2018, Vol. 79, Iss. 12, P. 2203–2216.
DOI: 10.1134/S0005117918120093 Go to publication
Linear algorithm for a cyclic graph transformation.
Lobachevskii Journal of Mathematics,
2018, Vol. 39, No. 9, P. 1217–1227.
DOI: 10.1134/S1995080218090147 Go to publication
Highly conserved elements in mitochondrial genomes of ciliates and monocots.
Materials of the IX International Congress “Biotechnology: State of the Art and Prospects of Development”,
Moscow, Russia, February 20–22 2017, Part 1, P. 393. Go to publication
Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.
BMC Bioinformatics,
2017, Vol. 18, No. 537.
doi:10.1186/s12859-017-1944-x, PMID: 29212445
(WoS Q1) Go to publication
Transformation of large chromosome structures: an algorithm of equalization of gene contents.
CEUR Workshop Proceedings,
Feb 23 2018, Vol. 2064, Convergent Cognitive Information Technologies 2017, P. 395–401, in Russian. Go to publication
A linear algorithm for the shortest transformation of graphs with different operation costs.
Journal of Communications Technology and Electronics,
2017, Vol. 62, No. 6, P. 653–662.
doi:10.1134/S1064226917060092 Go to publication
Algorithm of transformation of a graph into another one with minimal cost.
Informatics and it"s applications,
2017, Vol. 11, Iss. 1, P. 79–89 (in Russian). doi:10.14357/19922264170107
Linear algorithm for minimal rearrangement of structures.
Problems of Information Transmission,
2017, Vol. 53, Iss. 1, P. 55–72. doi:10.1134/S0032946017010057
