Ontology type: schema:ScholarlyArticle Open Access: True
2011-12
AUTHORSValery O Polyanovsky, Mikhail A Roytberg, Vladimir G Tumanyan
ABSTRACTBACKGROUND: 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... »
PAGES25
http://scigraph.springernature.com/pub.10.1186/1748-7188-6-25
DOIhttp://dx.doi.org/10.1186/1748-7188-6-25
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1010037303
PUBMEDhttps://www.ncbi.nlm.nih.gov/pubmed/22032267
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
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