Linked Life Data

2257499

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

Statements in which the resource exists as a subject.
PredicateObject
rdf:type
lifeskim:mentions
pubmed:issue
4
pubmed:dateCreated
1991-1-29
pubmed:abstractText
Existing dynamic-programming algorithms for identifying similar regions of two sequences require time and space proportional to the product of the sequence lengths. Often this space requirement is more limiting than the time requirement. We describe a dynamic-programming local-similarity algorithm that needs only space proportional to the sum of the sequence lengths. The method can also find repeats within a single long sequence. To illustrate the algorithm's potential, we discuss comparison of a 73,360 nucleotide sequence containing the human beta-like globin gene cluster and a corresponding 44,594 nucleotide sequence for rabbit, a problem well beyond the capabilities of other dynamic-programming software.
pubmed:grant
pubmed:language
eng
pubmed:journal
pubmed:citationSubset
IM
pubmed:chemical
pubmed:status
MEDLINE
pubmed:month
Oct
pubmed:issn
0266-7061
pubmed:author
pubmed:issnType
Print
pubmed:volume
6
pubmed:owner
NLM
pubmed:authorsComplete
Y
pubmed:pagination
373-81
pubmed:dateRevised
2007-11-14
pubmed:meshHeading
pubmed:year
1990
pubmed:articleTitle
A space-efficient algorithm for local similarities.
pubmed:affiliation
Department of Computer Science, Michigan Technological University, Houghton 49931.
pubmed:publicationType
Journal Article, Comparative Study, Research Support, U.S. Gov't, P.H.S.