Русская версия English version   
Том 19   Выпуск 2   Год 2024
Список литературы

  1. Levenshtein V.I. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady. 1966;10(8):707-710.
  2. Leont'ev V.K. Reconstruction of cyclic words from their fragments. Problems of Information Transmission. 2012;48(2):193-197. doi: 10.1134/S0032946012020093
  3. Tetuev R.K., Nazipova N.N. Statistical model for predicting TALEN-DNA binding sites based on moving average. Mat. Biolog. Bioinform. 2023;18(2):621-645. doi: 10.17537/2023.18.621
  4. Fu L., Cao Y., Wu J., Peng Q., Nie Q., Xie X. UFold: fast and accurate RNA secondary structure prediction with deep learning.Nucleic Acids Research. 2022;50(3):e14. doi: 10.1093/nar/gkab1074
  5. Chen C.C., Chan Y.M. REDfold: accurate RNA secondary structure prediction using residual encoder-decoder network. BMC Bioinformatics. 2023;24:1-13. Article No. 122. doi: 10.1186/s12859-023-05238-8
  6. Grinkevich L.N. The role of microRNAs in learning and long-term memory. Vavilov Journal of Genetics and Breeding. 2020;24(8):885-896. doi: 10.18699/VJ20.687
  7. Mikhailov K.V., Efeykin B.D., Panchin A.Y., Knorre D.A., Logacheva M.D., Penin A.A., Muntyan M.S., Nikitin M.A., Popova O.V., Zanegina O.N., Vyssokikh M.Y., Spiridonov S.E., Aleoshin V.V., Panchin Y.V. Coding palindromes in mitochondrial genes of Nematomorpha. Nucleic Acids Research. 2019;47(13):6858-6870. doi: 10.1093/nar/gkz517
  8. Nikolaeva O.V., Beregova A.M., Efeykin B.D., Miroliubova T.S., Zhuravlev A.Yu., Ivantsov A.Yu., Mikhailov K.V., Spiridonov S.E., Aleoshin V.V. Expression of hairpin-enriched mitochondrial DNA in two hairworm species (Nematomorpha). International Journal of Molecular Sciences. 2023;24(14). Article No. 11411. doi: 10.3390/ijms241411411
  9. Miroshnichenko L.A., Arefieva N.A., Dzhioev Yu.P., Gusev V.D., Borisenko A.Yu., Erdyneev S.V., Bukin Yu.S. Repeat structure in Salmonella genomes. Mat. Biolog. Bioinform. 2023;18(2):602-620. doi: 10.17537/2023.18.602
  10. Lyubetsky V.A., Zverkov O.A., Rubanov L.I., Seliverstov A.V. Modeling RNA polymerase competition: the effect of $upsigma$-subunit knockout and heat shock on gene transcription level. Biology Direct. 2011;6(3):1-16. doi: 10.1186/1745-6150-6-3
  11. Zverkov O.A., Rusin L.Yu., Seliverstov A.V., Lyubetsky V.A. Study of direct repeats in micro evolution of plant mitochondria and plastids based on protein clustering. Moscow University Biological Sciences Bulletin. 2013;68:58-62. doi: 10.3103/S0096392513020119
  12. Alzamel M., Hampson C., Iliopoulos C.S., Lim Z., Pissis S., Vlachakis D., Watts S.Maximal degenerate palindromes with gaps and mismatches. Theoretical Computer Science. 2023;978:1-16. Article No. 114182. doi: 10.1016/j.tcs.2023.114182
  13. Needleman S.B., Wunsch Ch.D. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology. 1970;48(3):443-453. doi: 10.1016/0022-2836(70)90057-4
  14. Yankovskiy V.O. Isometry groups of formal languages for generalized Levenshtein distances. Mathematical Notes. 2024;116(2):373-381. doi: 10.1134/S0001434624070307
  15. Matematicheskie metody dlia analiza posledovatel'nostei DNK. Ed. Waterman M.S. Moscow, 1999. 349 p. (Translation of: Mathematical methods for DNA sequences. Ed. Waterman M.S. CRC Press, 1989).
  16. Backurs A., Indyk P. Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). SIAM Journal on Computing. 2018;47(3):1087-1097. doi: 10.1137/15M1053128
  17. Masek W.J., Paterson M.S. A faster algorithm computing string edit distances. Journal of Computer and System Sciences. 1980;20(1):18-31. doi: 10.1016/0022-0000(80)90002-1
  18. Arlazarov V.L., Dinic E.A., Kronrod M.A., Faradzev I.A. On economic construction of the transitive closure of a directed graph. Soviet Math. Dokl. 1970;11(5):1209-1210.
  19. Crochemore M., Landau G.M., Ziv-Ukelson M. A subquadratic sequence alignment algorithm for unrestricted score matrices. SIAM Journal on Computing. 2003;32(6):1654-1673. doi: 10.1137/S0097539702402007
  20. Tiskin A. Semi-local longest common subsequences in subquadratic time. Journal of Discrete Algorithms. 2008;6(4):570-581. doi: 10.1016/j.jda.2008.07.001
  21. Akmal S., Jin C. Near-optimal quantum algorithms for string problems. Algorithmica. 2023;85:2260-2317. doi: 10.1007/s00453-022-01092-x
  22. Tetuev R.K., Pyatkov M.I., Pankratov A.N. Parallel algorithm for global alignment of long aminoacid and nucleotide sequences. Math. Biol. Bioinf. 2017;12(1):137-150. doi: 10.17537/2017.12.137
  23. Mishin N., Berezun D., Tiskin A. Efficient parallel algorithms for string comparison. ICPP '21: Proceedings of the 50th International Conference on Parallel Processing. 2021;50:1-10. doi: 10.1145/3472456.3472489
  24. Tiskin A. Periodic string comparison. In: Combinatorial Pattern Matching. CPM 2009. Eds. Kucherov G., Ukkonen E. Springer, Berlin, Heidelberg, 2009. (Lecture Notes in Computer Science, vol. 5577). doi: 10.1007/978-3-642-02441-2
  25. Zolotov B.A., Gaevoi N.S., Tiskin A.V. Algorithms for comparing periodic strings. In: The IV Conference of Mathematical Centers of Russia: Collection of Abstracts. St. Petersburg, 2024. P. 143 (in Russ.).
  26. Sokol D., Benson G., Tojeira J. Tandem repeats over the edit distance. Bioinformatics. 2007;23(2):e30-e35. doi: 10.1093/bioinformatics/btl309
  27. Sokol D., Tojeira J. Speeding up the detection of tandem repeats over the edit distance. Theoretical Computer Science. 2014;525:103-110. doi: 10.1016/j.tcs.2013.04.021
  28. Tiskin A. Fast distance multiplication of unit-Monge matrices. Algorithmica. 2015;71:859-888. doi: 10.1007/s00453-013-9830-z
  29. Conte A., Grossi R., Punzi G., Uno T. Enumeration of maximal common subsequences between two strings. Algorithmica. 2022;84:757-783. doi: 10.1007/s00453-021-00898-5
  30. Kociumaka T., Radoszewski J., Starikovskaya T. Longest common substring with approximately k mismatches. Algorithmica. 2019;81(6):2633-2652. doi: 10.1007/s00453-019-00548-x
  31. Amir A., Charalampopoulos P., Pissis S.P., Radoszewski J. Dynamic and internal longest common substring. Algorithmica. 2020;82:3707-3743. doi: 10.1007/s00453-020-00744-0
  32. Ai J., Sun L.-H., Che H., Zhang R., Zhang T.-Z., Wu W.-C., Su X.-L., Chen X., Yang G., Li K., Wang N., Ban T., Bao Y.-N., Guo F., Niu H.-F., Zhu Y.-L., Zhu X.-Y., Zhao S.-G., Yang B.-F. MicroRNA-195 protects against dementia induced by chronic brain hypoperfusion via its anti-amyloidogenic effect in rats. Journal of Neuroscience. 2013;33(9):3989-4001. doi: 10.1523/JNEUROSCI.1997-12.2013
  33. Chanin R.B., West P.T., Wirbel J., Gill M.O., Green G.Z.M., Park R.M., Enright N., Miklos A.M., Hickey A.S., Brooks E.F., Lum K.K., Cristea I.M., Bhatt A.S. Intragenic DNA inversions expand bacterial coding capacity. Nature. 2024;634:234-242. doi: 10.1038/s41586-024-07970-4
Содержание Оригинальная статья
Зверков О.А., Селиверстов А.В., Шиловский Г.А. Выравнивание скрытого палиндрома. Математическая биология и биоинформатика. 2024;19(2):427-438. doi: 10.17537/2024.19.427
(опубликована на рус. яз.)

Аннотация (рус.)
Аннотация (англ.)
Полный текст (рус., pdf)
Список литературы

 

  Copyright ИМПБ РАН © 2005-2026