<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>The method of generation barcode for DNA certification of plants and other organisms</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Olga Kiryanova</string-name>
          <email>olga.kiryanova27@gmail.com</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bulat Kuluev</string-name>
          <email>kuluev@bk.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ilya Kiryanov</string-name>
          <email>ilya.lsc@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alexey Chemeris</string-name>
          <email>chemeris@anrb.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Liana Akhmetzianova</string-name>
          <email>www.lianab@mail.ru</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Corning, Inc.</institution>
          ,
          <addr-line>Saint Petersburg</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute of Biochemistry and Genetics;, Ufa Federal Research Center</institution>
          ,
          <addr-line>RAS, Ufa</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Institute of Petrochemistry and</institution>
          ,
          <addr-line>Catalisys;</addr-line>
          ,
          <institution>Ufa Federal Research Center</institution>
          ,
          <addr-line>RAS, Ufa</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Ufa State Petroleum Technological, University</institution>
          ,
          <addr-line>Ufa</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2007</year>
      </pub-date>
      <issue>51</issue>
      <fpage>207</fpage>
      <lpage>210</lpage>
      <abstract>
        <p>-In the current paper a new DNA certification method for living organisms was presented. The suggested approach is based on unique barcode that identifies a particular organism. The studies were conducted using several species of crops and model plants (Solanum tuberosum, Triticum aestivum, Arabidopsis thaliana). The web based application was developed on the base of the proposed technique.</p>
      </abstract>
      <kwd-group>
        <kwd>polymerase chain reaction</kwd>
        <kwd>primer design</kwd>
        <kwd>DNA certification</kwd>
        <kwd>barcode</kwd>
        <kwd>web application</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>I. INTRODUCTION</title>
      <p>
        Polymerase chain reaction (PCR) is an experimental
method of molecular biology that can significantly increase
the quantity of target DNA fragments with specific
nucleotide sequences in a sample [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. PCR is widely used in
biological and medical practice to isolate new genes,
diagnose diseases and for other tasks.
      </p>
      <p>PCR was invented in the midle of the 1980s. Nowadays it
is the leading method in the field of physical and chemical
biology.</p>
      <p>
        Primers (short DNA fragments consisting of 10-30
nucleotides) are important components that affect on success
of experiments [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Primers in PCR must satisfy the main
requirements: specificity of amplification process and its
efficiency. A pair of primers are usually used in PCR.
However, in some cases a single primer may be sufficient
since it is involved in forward and reverse primers
simultaneously [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Such approach with single primer is used
for DNA polymorphism elucidation. For multiplex PCR,
several primers can be used simultaneously, usually up to 12.
More than one pair of oligonucleotide primers at the same
time leads to the coamplification of DNA matrices with
results in multiple PCR products [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In this case primers
could be annealed in pairs in all possible combinations. An
example of primer annealing in the multiplex PCR is shown
on figure 1.
      </p>
      <p>Fig. 1. An example of primer annealing in the multiplex PCR.</p>
      <p>Different primers are shown in different colors. Red
brackets denote the amplicons sizes.</p>
      <p>It is possible to make predictions of amplicons sizes on
the base of known complete nucleotide sequence of the
analyzed organism. This is a complicated task which could
not be done manually. For example, a genome with 1 billion
pairs of nucleotides has about 103 annealing sites for
decamer primers. To solve this problem a web based
application was developed. The proposed software allows to
determine the annealing positions of primers in the DNA
chain indicating the length of amplicons. Since the
probability of obtaining identical results for different
genomes is negligible, the obtained data could be represented
as unique barcode which, in its turn, represents a digital
DNA passport [5].</p>
    </sec>
    <sec id="sec-2">
      <title>II. PROBLEM DESCRIPTION</title>
      <p>The global efforts in creation and promotion of new
varieties of agricultural crops requires the modernization of
the selection process. Currently existing solutions for DNA
certification of plants do not allow to obtain digitized data.
The proposed barcode system is based on the polymorphism
of specific genes (most often the cytochrome oxidase gene).
Therefore, the detected degree of polymorphism is quite low
and allows us to detect only the relationship of individual
groups of organisms, as well as their location on the
evolutionary tree [6-8]. Some recently dispersed species may
not be distinguishable based on analysis of several genes.
Modern instrumental methods for unambiguous genetic
identification of biological material do not allow to
determine the difference between plant varieties. The
development of a well-reproducible and relatively
inexpensive method of DNA certification of varieties and
their DNA identification is an urgent task. Improved or new
solutions for the abovementioned problem could ensure
significant economic growth in the agricultural sector of
economy.</p>
      <p>For unambiguous certification and identification we
proposed a new approach: to assign unique genetic barcodes
to plant varieties based on the detected DNA polymorphism
using PCR. It does not require prior knowledge about
genome of any plant species.</p>
      <p>
        There are more than 20 methods for detecting DNA
polymorphism in plants. However, none of them could
provide true digital data and does not have proper
reproducibility [
        <xref ref-type="bibr" rid="ref10 ref8 ref9">9-12</xref>
        ]. The experimental basis of the DNA
certification method is a modified PCR based on the RAPD
Random Amplified Polymorphic DNA amplification
method. It is preferable to perform computer analysis before
the laboratory experiments conduction. Such computer
modeling could assist to determine the places of possible
annealing sites and sizes of reaction products (amplicons).
      </p>
      <p>
        In order to determine the amplicon size in silico it is
necessary to know positions of direct and reverse primers in
a nucleotide sequence. After that the distance between these
primers could be determined. That distance is called the
amplicon size and must have from 51 to 500 nucleotides
length inclusive. This range is optimal for most cases of gel
electrophoresis and sequencing [
        <xref ref-type="bibr" rid="ref11">13</xref>
        ]. A search example is
shown on figure 2.
      </p>
      <p>
        Following the above-mentioned logic the proposed
software collects information on all available occurrences of
primers and amplicons lengths [
        <xref ref-type="bibr" rid="ref12">14</xref>
        ]. An example of result is
shown in table 1.
      </p>
      <p>Information about genome is presented as a single file or
collection of files with text data according FASTA standard.
This is the most common format for digital storage of
nucleotide sequences. Nucleotide sequences are stored as
strings of characters “A”, “G”, “C”, “T” and sometimes “N”.
Each letter means the corresponding nucleobase: adenine,
guanine, cytosine, and thymine respectively. “N” means
unknown nucleotide. FASTA format allows easy data
manipulations with sequences using text editors and
programming languages such as Python, Ruby, Perl, etc.
That is why FASTA files are widely used for primers
positions search. According to the FASTA file format
specification, above mentioned task could be reduced to the
well-known approach: substring search in a string.</p>
      <p>
        There are several well-known algorithms for substring
search in a string: linear search, Knuth-Morris-Pratt
algorithm and the Boyer-Moore algorithm [
        <xref ref-type="bibr" rid="ref13">15</xref>
        ]. The
BoyerMoore algorithm is considered as the fastest among
generalpurpose classical algorithms designed to find a substring in a
string. The main advantage of the Boyer-Moore algorithm is
that the shift is calculated based on the pattern (but not over
the line where search is conducted). The pattern comparison
with a fragment of the string occurs from right to left. In
addition, the search pattern is not compared with the source
text in all positions, most of them are skipped as obviously
unsuccessful. General evaluation of the computational
complexity of the linear algorithm – O(nm), where m is the
length of the search pattern, n the length of the search string.
General evaluation of the computational complexity of the
Boyer-Moore and Knuth-Morris-Pratt algorithms is O(m+n)
[
        <xref ref-type="bibr" rid="ref14">16</xref>
        ].
      </p>
      <p>
        A comparative analysis of algorithms efficiency was
performed using genome with 106 nucleotides. It was shown
that the Boyer-Moore algorithm is more suitable for primers
search [
        <xref ref-type="bibr" rid="ref15">17</xref>
        ]. Thus, the Boyer-Moore algorithm was used to
implement the substring (primer) search.
      </p>
      <p>
        It should be mentioned, that one presented search
technique was implemented using Python language with JIT
Numba-compiler [
        <xref ref-type="bibr" rid="ref16">18</xref>
        ].
      </p>
      <p>On the base of data about the length of amplicons a
barcode could be generated. The barcode is represented as a
set of lines which determine the presence of amplicon length
in the range from 51 to 500 nucleotides. We assumed that
this range includes 450 imaginary DNA cells, which may
contain DNA (and this will be DNA+-cell) or no DNA
(DNA--cell). The presence of one or more DNA fragments
with the same size in a specific DNA+-cell is not important
since it is a qualitative rather than quantitative analysis.
Thus, the information about each sample can be presented
from alternating zeros and ones in the selected range of
lengths taken in the amplicon analysis. For example,
consider the range from 101 to 110 nucleotides, where the
finding of DNA fragments has the following form: …101-,
102+, 103-, 104-, 105-, 106-, 107+, 108-, 109-, 110- …. The
numbers denote the size of DNA fragment in nucleotides, (+)
– presence of a DNA fragment, (-) – absence of a DNA
fragment. In binary format the entry for this section will be
as follows: …0100001000.</p>
      <p>Visually such data could be conveniently represented as
genetic barcodes in a linear or two-dimensional display. For
example, for the data in table 1 the corresponding barcode is
shown on figure 3.</p>
      <p>The main advantage of the proposed approach is easy
comparison of two independent genetic characteristics. It is
possible to accurately measure the amplicon length after its
separation in capillary gel electrophoresis under denaturing
conditions.</p>
      <p>The obtained data about the primer(s), the analyzed
genome, and the set of selected amplicons are unique. It is
completely eliminating the accidental barcode coincidence
of different samples of strains, races, varieties, breeds, or
individuals. Since the amplicons can have a huge number of
variants (combinations) of the distribution of these DNA
fragments on DNA+ cells.</p>
      <p>The total number of occurrences combinations in such
DNA cells could be calculated as the number of
combinations from m to n using the following formula (1):
   =</p>
      <p>! 
 !( − )!

where C is the total number of probabilistic occurrences
combinations in DNA cells, m the number of all DNA-cells
analyzed in the selected range, and n the number of all
DNA+-cells.</p>
      <p>According to the probability theory, the largest number
of combinations occurs when half of the cells are occupied
with DNA fragments (225 of 450). In this case the number
of combinations exceed 10100. This number is more than
enough for unambiguous DNA certification of any
organism. The probability of a random match of two DNA
samples with the number of different-sized amplicons equal
to five is about one case per 1012. Thus, the proposed
approach is an efficient method for DNA certification of
cultivars, lines, breeds, and strains.</p>
    </sec>
    <sec id="sec-3">
      <title>III. ABCDNA_GS (AMPLIFIED BAR-CODED DNA</title>
      <p>GENOME/SPECIMEN)</p>
      <p>We have developed the web application with database for
storing information about the amplicons and barcode
generation.</p>
      <p>Input data is: domain (Archaea, Prokaryotes,
Eukaryotes), Kingdom (Animals, Plants, Fungus) – only for
Eukaryotes, genome, primer(s), type of DNA amplification
(RAPD, ISSR, AFLP). The entire genomes of different
organisms including from resource EnsembleGenomes
http://ensemblgenomes.org as FASTA files.</p>
      <p>The output data is: found amplicons sizes and the
corresponding barcode.</p>
      <p>As a result, found amplicons sizes allow to estimate the
outcome of any particular PCR experiment.</p>
      <p>In other words, obtained data allows to plan the PCR
experiment for any genome. In addition, compare
experimentally obtained amplicons with those found as a
result of the program.</p>
    </sec>
    <sec id="sec-4">
      <title>User interface example is shown on the figure 4.</title>
      <p>In addition to computer analysis it is possible to compare
wet lab experiments (in vitro found amplicons) and predicted
PCR outcome by comparing two barcodes.</p>
      <p>
        Thus, the generated information is a kind of digital
passport for varieties, breeds, strains of various
organisms [
        <xref ref-type="bibr" rid="ref17">19</xref>
        ].
      </p>
    </sec>
    <sec id="sec-5">
      <title>IV. CONCLUSIONS</title>
      <p>
        We proposed a new approach for cataloging/certifying
diverse groups of plants and other organisms. These
unambiguous certification and identification were carried out
by assigning unique genetic barcodes to plant varieties based
on the detected DNA polymorphism. In addition, this method
is applicable for all living organisms besides human. Other
methods are used for DNA identification of an individual
approaches, the most promising for data barcode is
considered to be single-nucleotide DNA polymorphism.
Currently, many approaches are used for DNA certification
of plant varieties but none of them provides unambiguous
digital data. Thus, the suggested approach for DNA
certification (cataloging)/identification of living organisms is
unique. In addition, the web application was developed that
allows to detect the presence of specific primers in the DNA
(genomes), determine the size of amplicons that are formed
as a result of PCR, and create the corresponding unique
barcode. In the future, it is planned to translate data into QR
code and use machine learning methods to classify barcodes
and compare related varieties. [
        <xref ref-type="bibr" rid="ref18">20</xref>
        ].
      </p>
      <p>
        Web based application allows to catalog wet laboratory
experiments and in silico analysis. The entire genomes of
different organisms including Solanum tuberosum, Triticum
aestivum, Arabidopsis thaliana available from resource
EnsembleGenomes http://ensemblgenomes.org. Thus,
without conducting a full-scale experiment it is possible to
test several primers as well as get an idea of the full-scale
experiment success. Due to the uniqueness of the proposed
approach it is possible systematize data for different primers
and DNA sequences without taking into account their natural
affiliation. It was shown that barcoding could enhance the
genome comparison by excluding the human factor [
        <xref ref-type="bibr" rid="ref19">21</xref>
        ],
allows to get digital data about a certain genome, and leads
to the intuitive and clear comparison among other digitized
genomes.
      </p>
    </sec>
    <sec id="sec-6">
      <title>ACKNOWLEDGMENT</title>
      <p>This research was supported by the Russian Foundation
for Basic Research (project № 17-44-020120).
[5] “What is FASTA format?” [Online]. URL: https://zhanglab.ccmb.</p>
      <p>med.umich.edu/FASTA/.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>B.</given-names>
            <surname>Glik</surname>
          </string-name>
          and G. Pasternak, “
          <article-title>Molecular biotechnology</article-title>
          . Principles and application,” Moscow: Mir,
          <year>2002</year>
          , 589 p.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>R.R.</given-names>
            <surname>Garafutdinov</surname>
          </string-name>
          , Аn.Kh. Baymiev,
          <string-name>
            <given-names>G.V.</given-names>
            <surname>Maleev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Ya.I.</given-names>
            <surname>Alekseev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.V.</given-names>
            <surname>Zubov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.A.</given-names>
            <surname>Chemeris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Yu</surname>
          </string-name>
          . Kiryanova,
          <string-name>
            <surname>I.М</surname>
          </string-name>
          . Gubaydullin,
          <string-name>
            <given-names>R.T.</given-names>
            <surname>Matniyazov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.R.</given-names>
            <surname>Sakhabutdinova</surname>
          </string-name>
          ,
          <string-name>
            <surname>Yu.M. Nikonorov</surname>
            ,
            <given-names>B.R.</given-names>
          </string-name>
          <string-name>
            <surname>Kuluev</surname>
            , Аl.Kh. Baymiev and
            <given-names>A.V.</given-names>
          </string-name>
          <string-name>
            <surname>Chemeris</surname>
          </string-name>
          , “
          <article-title>Variety of PCR primers and principles of their selection</article-title>
          ,
          <source>” Biomics</source>
          , vol.
          <volume>11</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>23</fpage>
          -
          <lpage>70</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>B.R.</given-names>
            <surname>Kuluev</surname>
          </string-name>
          , An.Kh. Baymiev,
          <string-name>
            <given-names>G.A.</given-names>
            <surname>Gerashchenkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.A.</given-names>
            <surname>Chemeris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.V.</given-names>
            <surname>Zubov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.R.</given-names>
            <surname>Kuluev</surname>
          </string-name>
          , Al.Kh. Baymiev and
          <string-name>
            <given-names>A.V.</given-names>
            <surname>Chemeris</surname>
          </string-name>
          , “
          <article-title>Random priming PCR strategies for identification of multilocus DNA polymorphism in eukaryotes</article-title>
          ,”
          <source>Russian Journal of Genetics</source>
          , vol.
          <volume>54</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>499</fpage>
          -
          <lpage>513</lpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.S.</given-names>
            <surname>Chamberlain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.A.</given-names>
            <surname>Gibbs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.E.</given-names>
            <surname>Ranier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.N.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.T.</given-names>
            <surname>Caskey</surname>
          </string-name>
          , “
          <article-title>Deletion screening of the Duchenne muscular dystrophy locus via multiplex DNA amplification</article-title>
          ,
          <source>” Nucleic Acids Research</source>
          , vol.
          <volume>16</volume>
          , no.
          <issue>23</issue>
          , pp.
          <fpage>11141</fpage>
          -
          <lpage>11156</lpage>
          ,
          <year>1988</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Cywinska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.L.</given-names>
            <surname>Ball</surname>
          </string-name>
          and
          <string-name>
            <surname>J.R.</surname>
          </string-name>
          <year>deWaard</year>
          , “
          <article-title>Biological identifications through DNA bar-</article-title>
          codes,
          <source>” Proc. R. Soc. Lond. B Biol. Sci.</source>
          , vol.
          <volume>270</volume>
          , pp.
          <fpage>313</fpage>
          -
          <lpage>321</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>P.D.N. Hebert</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Ratnasingham</surname>
            and
            <given-names>J.R.</given-names>
          </string-name>
          <year>deWaard</year>
          , “
          <article-title>Barcoding animal life: cytochromecoxidase I diver-gences among closely related species</article-title>
          ,
          <source>” Proc. R. Soc. Lond. B Biol. Sci.</source>
          , vol.
          <volume>270</volume>
          , pp.
          <fpage>596</fpage>
          -
          <lpage>599</lpage>
          ,
          <year>2003</year>
          . DOI:
          <volume>10</volume>
          .1016/j.pedobi.
          <year>2007</year>
          .
          <volume>05</volume>
          .003.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>H.</given-names>
            <surname>Nybom</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Weising</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Rotter</surname>
          </string-name>
          , “
          <article-title>DNA fingerprinting in botany: past, present</article-title>
          , future,”
          <article-title>Investigative genetics</article-title>
          , vol.
          <volume>5</volume>
          , no.
          <issue>1</issue>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>K.N.</given-names>
            <surname>Babu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.K.</given-names>
            <surname>Rajesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Samsudeen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Minoo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.J.</given-names>
            <surname>Suraby</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Anupama</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Ritto</surname>
          </string-name>
          , “
          <article-title>Randomly amplified polymorphic DNA (RAPD) and derived techniques,” Methods Mol Biol</article-title>
          ., vol.
          <volume>1115</volume>
          , pp.
          <fpage>191</fpage>
          -
          <lpage>209</lpage>
          ,
          <year>2014</year>
          . DOI:
          <volume>10</volume>
          .1007/978-1-
          <fpage>62703</fpage>
          -767-9_
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ougham</surname>
          </string-name>
          , H. Thomas and
          <string-name>
            <surname>I. Pasakinskiene</surname>
          </string-name>
          , “
          <article-title>Markers and mapping revisited: finding your gene,” New Phytol</article-title>
          ., vol.
          <volume>183</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>935</fpage>
          -
          <lpage>966</lpage>
          ,
          <year>2009</year>
          . DOI:
          <volume>10</volume>
          .1111/j.1469-
          <fpage>8137</fpage>
          .
          <year>2009</year>
          .
          <volume>02933</volume>
          .x.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>P.</given-names>
            <surname>Poczai</surname>
          </string-name>
          , I. Varga,
          <string-name>
            <given-names>M.</given-names>
            <surname>Laos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cseh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Bell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. P.</given-names>
            <surname>Valkonen</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Hyvönen</surname>
          </string-name>
          , “
          <article-title>Advances in plant gene-targeted and functional markers: a review,” Plant Methods</article-title>
          , vol.
          <volume>9</volume>
          , no.
          <issue>1</issue>
          ,
          <year>2013</year>
          . DOI:
          <volume>10</volume>
          .1186/
          <fpage>1746</fpage>
          - 4811-9-6.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>O.</given-names>
            <surname>Yu</surname>
          </string-name>
          . Kiryanova and
          <string-name>
            <given-names>A.V.</given-names>
            <surname>Chemeris</surname>
          </string-name>
          , “
          <article-title>Modeling the search for primers in the DNA chain,” Materials of the V International conference on information technology and nanotechnology ITNT, Samara</article-title>
          , Russia, pp.
          <fpage>774</fpage>
          -
          <lpage>778</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>O.</given-names>
            <surname>Yu. Kiryanova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.U.</given-names>
            <surname>Akhmetzianova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.R.</given-names>
            <surname>Kuluev</surname>
          </string-name>
          and
          <string-name>
            <given-names>I.M.</given-names>
            <surname>Gubaydullin</surname>
          </string-name>
          , “
          <article-title>Program for searching primers for polymerase chain reaction,” Materials of the XIII Russian scientific Internet conference Integration of science and higher education in the field of bio-and organic chemistry and biotechnology</article-title>
          , Ufa, Russia, pp.
          <fpage>153</fpage>
          -
          <lpage>154</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>O.</given-names>
            <surname>Yu. Kiryanova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.U.</given-names>
            <surname>Akhmetzianova</surname>
          </string-name>
          and
          <string-name>
            <given-names>I.M.</given-names>
            <surname>Gubaydullin</surname>
          </string-name>
          , “
          <article-title>Search algorithms in the analysis of nucleotide sequences for unambiguous identification of genomes</article-title>
          ,” Bulletin of Bashkir University, vol.
          <volume>25</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>285</fpage>
          -
          <lpage>289</lpage>
          . DOI:
          <volume>10</volume>
          .33184/bulletin-bsu2020.
          <fpage>2</fpage>
          .10.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>D.</given-names>
            <surname>Gusfield</surname>
          </string-name>
          , “Algorithms on Strings,
          <source>Trees and Sequences: Computer Science and Computational Biology</source>
          ,” Cambridge University Press,
          <year>2003</year>
          , 654 p.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>T.H.</given-names>
            <surname>Cormen</surname>
          </string-name>
          , Ch.Е. Leiserson,
          <string-name>
            <given-names>R.L.</given-names>
            <surname>Rivest</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Stein</surname>
          </string-name>
          , “
          <article-title>Algorithms: construction and analysis</article-title>
          ,” M:
          <string-name>
            <surname>Williams</surname>
          </string-name>
          ,
          <year>2005</year>
          , 801 p.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>O.</given-names>
            <surname>Yu</surname>
          </string-name>
          . Kiryanova,
          <string-name>
            <given-names>I.I.</given-names>
            <surname>Kiryanov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.U.</given-names>
            <surname>Akhmetzianova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.R.</given-names>
            <surname>Kuluev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.V.</given-names>
            <surname>Chemeris</surname>
          </string-name>
          and
          <string-name>
            <given-names>I.M.</given-names>
            <surname>Gubaydullin</surname>
          </string-name>
          , “
          <article-title>Parallel implementation of search algorithm for RNA guide design</article-title>
          ,
          <source>” Materials of International conference Parallel Computational Technologies (PCT)</source>
          , pp.
          <fpage>52</fpage>
          -
          <lpage>58</lpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>O.</given-names>
            <surname>Yu</surname>
          </string-name>
          . Kiryanova,
          <string-name>
            <given-names>I.I.</given-names>
            <surname>Kiryanov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.R.</given-names>
            <surname>Kuluev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.V.</given-names>
            <surname>Chemeris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.R.</given-names>
            <surname>Garafutdinov</surname>
          </string-name>
          and
          <string-name>
            <given-names>I.M.</given-names>
            <surname>Gubaydullin</surname>
          </string-name>
          , “ABCDNA_
          <string-name>
            <surname>GS (Amplifaied Bar-Coded</surname>
          </string-name>
          DNA Genome/Specimen)” [Online]. URL: https://www.fips.
          <article-title>ru/registers-doc-view/fips_servlet?DB=EVM&amp; DocNumber=2020610703&amp;TypeFile=html</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>V.V.</given-names>
            <surname>Arlazarov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bulatov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Chernov</surname>
          </string-name>
          and
          <string-name>
            <given-names>V.L.</given-names>
            <surname>Arlazarov</surname>
          </string-name>
          , “
          <article-title>MIDV500: a dataset for identity document analysis and recognition on mobile devices in video stream</article-title>
          ,”
          <source>Computer Optics</source>
          , vol.
          <volume>43</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>818</fpage>
          -
          <lpage>824</lpage>
          ,
          <year>2019</year>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>2412</fpage>
          -6179-2019-43-5-
          <fpage>818</fpage>
          -824.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>B.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Wang</surname>
          </string-name>
          , “PIDS:
          <string-name>
            <given-names>A</given-names>
            <surname>User-Friendly Plant DNA Fingerprint Database Management System</surname>
          </string-name>
          ,
          <source>” Genes</source>
          , vol.
          <volume>11</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>373</fpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>