Comparative analysis of the quality of a global algorithm and a local algorithm for alignment of two sequences View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2011-12

AUTHORS

Valery O Polyanovsky, Mikhail A Roytberg, Vladimir G Tumanyan

ABSTRACT

BACKGROUND: Algorithms of sequence alignment are the key instruments for computer-assisted studies of biopolymers. Obviously, it is important to take into account the "quality" of the obtained alignments, i.e. how closely the algorithms manage to restore the "gold standard" alignment (GS-alignment), which superimposes positions originating from the same position in the common ancestor of the compared sequences. As an approximation of the GS-alignment, a 3D-alignment is commonly used not quite reasonably. Among the currently used algorithms of a pair-wise alignment, the best quality is achieved by using the algorithm of optimal alignment based on affine penalties for deletions (the Smith-Waterman algorithm). Nevertheless, the expedience of using local or global versions of the algorithm has not been studied. RESULTS: Using model series of amino acid sequence pairs, we studied the relative "quality" of results produced by local and global alignments versus (1) the relative length of similar parts of the sequences (their "cores") and their nonhomologous parts, and (2) relative positions of the core regions in the compared sequences. We obtained numerical values of the average quality (measured as accuracy and confidence) of the global alignment method and the local alignment method for evolutionary distances between homologous sequence parts from 30 to 240 PAM and for the core length making from 10% to 70% of the total length of the sequences for all possible positions of homologous sequence parts relative to the centers of the sequences. CONCLUSION: We revealed criteria allowing to specify conditions of preferred applicability for the local and the global alignment algorithms depending on positions and relative lengths of the cores and nonhomologous parts of the sequences to be aligned. It was demonstrated that when the core part of one sequence was positioned above the core of the other sequence, the global algorithm was more stable at longer evolutionary distances and larger nonhomologous parts than the local algorithm. On the contrary, when the cores were positioned asymmetrically, the local algorithm was more stable at longer evolutionary distances and larger nonhomologous parts than the global algorithm. This opens a possibility for creation of a combined method allowing generation of more accurate alignments. More... »

PAGES

25

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1186/1748-7188-6-25

DOI

http://dx.doi.org/10.1186/1748-7188-6-25

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1010037303

PUBMED

https://www.ncbi.nlm.nih.gov/pubmed/22032267


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Russian Academy of Sciences", 
          "id": "https://www.grid.ac/institutes/grid.4886.2", 
          "name": [
            "Engelhardt Institute of Molecular Biology, RAS, 119991, Moscow, Russia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Polyanovsky", 
        "givenName": "Valery O", 
        "id": "sg:person.0667761002.35", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0667761002.35"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Institute of Mathematical Problems of Biology", 
          "id": "https://www.grid.ac/institutes/grid.435288.0", 
          "name": [
            "Institute of Mathematical Problems in Biology, RAS, 142290, Pushchino, Russia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Roytberg", 
        "givenName": "Mikhail A", 
        "id": "sg:person.01127115044.03", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01127115044.03"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Russian Academy of Sciences", 
          "id": "https://www.grid.ac/institutes/grid.4886.2", 
          "name": [
            "Engelhardt Institute of Molecular Biology, RAS, 119991, Moscow, Russia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Tumanyan", 
        "givenName": "Vladimir G", 
        "id": "sg:person.01320565010.86", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01320565010.86"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1093/bioinformatics/18.11.1500", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1009707938"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1093/nar/gkm278", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1012312918"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0022-2836(05)80360-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1013618994"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1093/bioinformatics/18.6.847", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1019815425"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1093/bioinformatics/19.2.228", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1019858047"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0022-2836(70)90057-4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1021169618"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0022-2836(81)90087-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1024589839"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1093/protein/9.2.127", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1025953297"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1006/jmbi.1993.1105", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028499762"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1093/bioinformatics/16.11.988", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1030025605"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1006/jmbi.1995.0340", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1036064419"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1134/s0026893306030149", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1037481884", 
          "https://doi.org/10.1134/s0026893306030149"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1006/jmbi.2000.3615", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1038600338"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1073/pnas.0906408106", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1045851678"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/prot.10503", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1045853915"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1093/nar/gkl1063", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1047646933"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1089/cmb.2007.0145", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1059245589"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1093/protein/3.7.565", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1059980533"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1126/science.2983426", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062579164"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1126/science.7280687", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062645221"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2011-12", 
    "datePublishedReg": "2011-12-01", 
    "description": "BACKGROUND: Algorithms of sequence alignment are the key instruments for computer-assisted studies of biopolymers. Obviously, it is important to take into account the \"quality\" of the obtained alignments, i.e. how closely the algorithms manage to restore the \"gold standard\" alignment (GS-alignment), which superimposes positions originating from the same position in the common ancestor of the compared sequences. As an approximation of the GS-alignment, a 3D-alignment is commonly used not quite reasonably. Among the currently used algorithms of a pair-wise alignment, the best quality is achieved by using the algorithm of optimal alignment based on affine penalties for deletions (the Smith-Waterman algorithm). Nevertheless, the expedience of using local or global versions of the algorithm has not been studied.\nRESULTS: Using model series of amino acid sequence pairs, we studied the relative \"quality\" of results produced by local and global alignments versus (1) the relative length of similar parts of the sequences (their \"cores\") and their nonhomologous parts, and (2) relative positions of the core regions in the compared sequences. We obtained numerical values of the average quality (measured as accuracy and confidence) of the global alignment method and the local alignment method for evolutionary distances between homologous sequence parts from 30 to 240 PAM and for the core length making from 10% to 70% of the total length of the sequences for all possible positions of homologous sequence parts relative to the centers of the sequences.\nCONCLUSION: We revealed criteria allowing to specify conditions of preferred applicability for the local and the global alignment algorithms depending on positions and relative lengths of the cores and nonhomologous parts of the sequences to be aligned. It was demonstrated that when the core part of one sequence was positioned above the core of the other sequence, the global algorithm was more stable at longer evolutionary distances and larger nonhomologous parts than the local algorithm. On the contrary, when the cores were positioned asymmetrically, the local algorithm was more stable at longer evolutionary distances and larger nonhomologous parts than the global algorithm. This opens a possibility for creation of a combined method allowing generation of more accurate alignments.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1186/1748-7188-6-25", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isFundedItemOf": [
      {
        "id": "sg:grant.5369551", 
        "type": "MonetaryGrant"
      }
    ], 
    "isPartOf": [
      {
        "id": "sg:journal.1036449", 
        "issn": [
          "1748-7188"
        ], 
        "name": "Algorithms for Molecular Biology", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "6"
      }
    ], 
    "name": "Comparative analysis of the quality of a global algorithm and a local algorithm for alignment of two sequences", 
    "pagination": "25", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "2fd161758bc43776b9604b0a9d6d17438bd03964367d27347216f9d653ca165c"
        ]
      }, 
      {
        "name": "pubmed_id", 
        "type": "PropertyValue", 
        "value": [
          "22032267"
        ]
      }, 
      {
        "name": "nlm_unique_id", 
        "type": "PropertyValue", 
        "value": [
          "101265088"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1186/1748-7188-6-25"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1010037303"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1186/1748-7188-6-25", 
      "https://app.dimensions.ai/details/publication/pub.1010037303"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T00:15", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8695_00000510.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1186%2F1748-7188-6-25"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1186/1748-7188-6-25'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1186/1748-7188-6-25'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1186/1748-7188-6-25'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1186/1748-7188-6-25'


 

This table displays all metadata directly associated to this object as RDF triples.

148 TRIPLES      21 PREDICATES      49 URIs      21 LITERALS      9 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1186/1748-7188-6-25 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Nb96be0e4eb3c406ca09a09e8b30eb38b
4 schema:citation sg:pub.10.1134/s0026893306030149
5 https://doi.org/10.1002/prot.10503
6 https://doi.org/10.1006/jmbi.1993.1105
7 https://doi.org/10.1006/jmbi.1995.0340
8 https://doi.org/10.1006/jmbi.2000.3615
9 https://doi.org/10.1016/0022-2836(70)90057-4
10 https://doi.org/10.1016/0022-2836(81)90087-5
11 https://doi.org/10.1016/s0022-2836(05)80360-2
12 https://doi.org/10.1073/pnas.0906408106
13 https://doi.org/10.1089/cmb.2007.0145
14 https://doi.org/10.1093/bioinformatics/16.11.988
15 https://doi.org/10.1093/bioinformatics/18.11.1500
16 https://doi.org/10.1093/bioinformatics/18.6.847
17 https://doi.org/10.1093/bioinformatics/19.2.228
18 https://doi.org/10.1093/nar/gkl1063
19 https://doi.org/10.1093/nar/gkm278
20 https://doi.org/10.1093/protein/3.7.565
21 https://doi.org/10.1093/protein/9.2.127
22 https://doi.org/10.1126/science.2983426
23 https://doi.org/10.1126/science.7280687
24 schema:datePublished 2011-12
25 schema:datePublishedReg 2011-12-01
26 schema:description BACKGROUND: Algorithms of sequence alignment are the key instruments for computer-assisted studies of biopolymers. Obviously, it is important to take into account the "quality" of the obtained alignments, i.e. how closely the algorithms manage to restore the "gold standard" alignment (GS-alignment), which superimposes positions originating from the same position in the common ancestor of the compared sequences. As an approximation of the GS-alignment, a 3D-alignment is commonly used not quite reasonably. Among the currently used algorithms of a pair-wise alignment, the best quality is achieved by using the algorithm of optimal alignment based on affine penalties for deletions (the Smith-Waterman algorithm). Nevertheless, the expedience of using local or global versions of the algorithm has not been studied. RESULTS: Using model series of amino acid sequence pairs, we studied the relative "quality" of results produced by local and global alignments versus (1) the relative length of similar parts of the sequences (their "cores") and their nonhomologous parts, and (2) relative positions of the core regions in the compared sequences. We obtained numerical values of the average quality (measured as accuracy and confidence) of the global alignment method and the local alignment method for evolutionary distances between homologous sequence parts from 30 to 240 PAM and for the core length making from 10% to 70% of the total length of the sequences for all possible positions of homologous sequence parts relative to the centers of the sequences. CONCLUSION: We revealed criteria allowing to specify conditions of preferred applicability for the local and the global alignment algorithms depending on positions and relative lengths of the cores and nonhomologous parts of the sequences to be aligned. It was demonstrated that when the core part of one sequence was positioned above the core of the other sequence, the global algorithm was more stable at longer evolutionary distances and larger nonhomologous parts than the local algorithm. On the contrary, when the cores were positioned asymmetrically, the local algorithm was more stable at longer evolutionary distances and larger nonhomologous parts than the global algorithm. This opens a possibility for creation of a combined method allowing generation of more accurate alignments.
27 schema:genre research_article
28 schema:inLanguage en
29 schema:isAccessibleForFree true
30 schema:isPartOf N85c0ccd66f944c1d9189fea957001f22
31 Ncdf30dd53c674e728ae6d101d3584938
32 sg:journal.1036449
33 schema:name Comparative analysis of the quality of a global algorithm and a local algorithm for alignment of two sequences
34 schema:pagination 25
35 schema:productId N4bcf98126f3a4e98906f7fc7ffea3716
36 N59362f686bfa485a834b2d29edb5ce7e
37 Ne46fbea3394749ba95eed85acc762fe8
38 Neeeea474eb6e4f04b0a8db7c43a98f0b
39 Nf4062372127d4051a2809cae663ff13e
40 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010037303
41 https://doi.org/10.1186/1748-7188-6-25
42 schema:sdDatePublished 2019-04-11T00:15
43 schema:sdLicense https://scigraph.springernature.com/explorer/license/
44 schema:sdPublisher N36788896405b405ca69406a9203ea878
45 schema:url http://link.springer.com/10.1186%2F1748-7188-6-25
46 sgo:license sg:explorer/license/
47 sgo:sdDataset articles
48 rdf:type schema:ScholarlyArticle
49 N36788896405b405ca69406a9203ea878 schema:name Springer Nature - SN SciGraph project
50 rdf:type schema:Organization
51 N4bcf98126f3a4e98906f7fc7ffea3716 schema:name dimensions_id
52 schema:value pub.1010037303
53 rdf:type schema:PropertyValue
54 N54e55c2a4ecf4b79a817028ed2fcf22d rdf:first sg:person.01127115044.03
55 rdf:rest N8cd803ec0b1e49659e79cd7468e491a2
56 N59362f686bfa485a834b2d29edb5ce7e schema:name pubmed_id
57 schema:value 22032267
58 rdf:type schema:PropertyValue
59 N85c0ccd66f944c1d9189fea957001f22 schema:volumeNumber 6
60 rdf:type schema:PublicationVolume
61 N8cd803ec0b1e49659e79cd7468e491a2 rdf:first sg:person.01320565010.86
62 rdf:rest rdf:nil
63 Nb96be0e4eb3c406ca09a09e8b30eb38b rdf:first sg:person.0667761002.35
64 rdf:rest N54e55c2a4ecf4b79a817028ed2fcf22d
65 Ncdf30dd53c674e728ae6d101d3584938 schema:issueNumber 1
66 rdf:type schema:PublicationIssue
67 Ne46fbea3394749ba95eed85acc762fe8 schema:name nlm_unique_id
68 schema:value 101265088
69 rdf:type schema:PropertyValue
70 Neeeea474eb6e4f04b0a8db7c43a98f0b schema:name readcube_id
71 schema:value 2fd161758bc43776b9604b0a9d6d17438bd03964367d27347216f9d653ca165c
72 rdf:type schema:PropertyValue
73 Nf4062372127d4051a2809cae663ff13e schema:name doi
74 schema:value 10.1186/1748-7188-6-25
75 rdf:type schema:PropertyValue
76 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
77 schema:name Information and Computing Sciences
78 rdf:type schema:DefinedTerm
79 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
80 schema:name Computation Theory and Mathematics
81 rdf:type schema:DefinedTerm
82 sg:grant.5369551 http://pending.schema.org/fundedItem sg:pub.10.1186/1748-7188-6-25
83 rdf:type schema:MonetaryGrant
84 sg:journal.1036449 schema:issn 1748-7188
85 schema:name Algorithms for Molecular Biology
86 rdf:type schema:Periodical
87 sg:person.01127115044.03 schema:affiliation https://www.grid.ac/institutes/grid.435288.0
88 schema:familyName Roytberg
89 schema:givenName Mikhail A
90 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01127115044.03
91 rdf:type schema:Person
92 sg:person.01320565010.86 schema:affiliation https://www.grid.ac/institutes/grid.4886.2
93 schema:familyName Tumanyan
94 schema:givenName Vladimir G
95 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01320565010.86
96 rdf:type schema:Person
97 sg:person.0667761002.35 schema:affiliation https://www.grid.ac/institutes/grid.4886.2
98 schema:familyName Polyanovsky
99 schema:givenName Valery O
100 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0667761002.35
101 rdf:type schema:Person
102 sg:pub.10.1134/s0026893306030149 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037481884
103 https://doi.org/10.1134/s0026893306030149
104 rdf:type schema:CreativeWork
105 https://doi.org/10.1002/prot.10503 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045853915
106 rdf:type schema:CreativeWork
107 https://doi.org/10.1006/jmbi.1993.1105 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028499762
108 rdf:type schema:CreativeWork
109 https://doi.org/10.1006/jmbi.1995.0340 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036064419
110 rdf:type schema:CreativeWork
111 https://doi.org/10.1006/jmbi.2000.3615 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038600338
112 rdf:type schema:CreativeWork
113 https://doi.org/10.1016/0022-2836(70)90057-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021169618
114 rdf:type schema:CreativeWork
115 https://doi.org/10.1016/0022-2836(81)90087-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024589839
116 rdf:type schema:CreativeWork
117 https://doi.org/10.1016/s0022-2836(05)80360-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013618994
118 rdf:type schema:CreativeWork
119 https://doi.org/10.1073/pnas.0906408106 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045851678
120 rdf:type schema:CreativeWork
121 https://doi.org/10.1089/cmb.2007.0145 schema:sameAs https://app.dimensions.ai/details/publication/pub.1059245589
122 rdf:type schema:CreativeWork
123 https://doi.org/10.1093/bioinformatics/16.11.988 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030025605
124 rdf:type schema:CreativeWork
125 https://doi.org/10.1093/bioinformatics/18.11.1500 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009707938
126 rdf:type schema:CreativeWork
127 https://doi.org/10.1093/bioinformatics/18.6.847 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019815425
128 rdf:type schema:CreativeWork
129 https://doi.org/10.1093/bioinformatics/19.2.228 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019858047
130 rdf:type schema:CreativeWork
131 https://doi.org/10.1093/nar/gkl1063 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047646933
132 rdf:type schema:CreativeWork
133 https://doi.org/10.1093/nar/gkm278 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012312918
134 rdf:type schema:CreativeWork
135 https://doi.org/10.1093/protein/3.7.565 schema:sameAs https://app.dimensions.ai/details/publication/pub.1059980533
136 rdf:type schema:CreativeWork
137 https://doi.org/10.1093/protein/9.2.127 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025953297
138 rdf:type schema:CreativeWork
139 https://doi.org/10.1126/science.2983426 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062579164
140 rdf:type schema:CreativeWork
141 https://doi.org/10.1126/science.7280687 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062645221
142 rdf:type schema:CreativeWork
143 https://www.grid.ac/institutes/grid.435288.0 schema:alternateName Institute of Mathematical Problems of Biology
144 schema:name Institute of Mathematical Problems in Biology, RAS, 142290, Pushchino, Russia
145 rdf:type schema:Organization
146 https://www.grid.ac/institutes/grid.4886.2 schema:alternateName Russian Academy of Sciences
147 schema:name Engelhardt Institute of Molecular Biology, RAS, 119991, Moscow, Russia
148 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...