Linked Life Data

2448477

Source:http://linkedlifedata.com/resource/pubmed/id/2448477

Statements in which the resource exists as a subject.
PredicateObject
rdf:type
lifeskim:mentions
pubmed:issue
4
pubmed:dateCreated
1988-3-3
pubmed:abstractText
The algorithm of Smith & Waterman for identification of maximally similar subsequences is extended to allow identification of all non-intersecting similar subsequences with similarity score at or above some preset level. The resulting alignments are found in order of score, with the highest scoring alignment first. In the case of single gaps or multiple gaps weighted linear with gap length, the algorithm is extremely efficient, taking very little time beyond that of the initial calculation of the matrix. The algorithm is applied to comparisons of tRNA-rRNA sequences from Escherichia coli. A statistical analysis is important for proper evaluation of the results, which differ substantially from the results of an earlier analysis of the same sequences by Bloch and colleagues.
pubmed:language
eng
pubmed:journal
pubmed:citationSubset
IM
pubmed:chemical
pubmed:status
MEDLINE
pubmed:month
Oct
pubmed:issn
0022-2836
pubmed:author
pubmed:issnType
Print
pubmed:day
20
pubmed:volume
197
pubmed:owner
NLM
pubmed:authorsComplete
Y
pubmed:pagination
723-8
pubmed:dateRevised
2006-11-15
pubmed:meshHeading
pubmed:year
1987
pubmed:articleTitle
A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons.
pubmed:affiliation
Department of Mathematics, University of Southern California, Los Angeles 90089-1113.
pubmed:publicationType
Journal Article, Research Support, U.S. Gov't, P.H.S., Research Support, Non-U.S. Gov't