Linked Life Data

10380198

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

Statements in which the resource exists as a subject.
PredicateObject
rdf:type
lifeskim:mentions
pubmed:dateCreated
1999-8-10
pubmed:abstractText
Genomic science and structural biology meet in the relationship between the sequence and the structure of nucleic acids. The structure that supports each function is preserved in the process of evolution as specific sequences. Particularly, the same sequence which appears in a different place such as a palindromic or repetitive sequence has biophysical meaning: recognition site of dimers, forming stem-loops, and contributions to global structure of nucleic acids. Also, the genetic network, transduction pathway, and tissue specificity largely depend on these. Although the relationship between them can be found experimentally, there is increasing demand for automated analysis. Especially, it is desirable to extract the same character sequences of arbitrary length (especially, very long ones) which co-occur at an arbitrary separation. We propose an algorithm to identify the maximum match sequence at each position with a calculation cost of O(N log N) and memory space of O(N). Applying it to some sequences, we found unexpectedly large palindromes and repeats in DNA.
pubmed:language
eng
pubmed:journal
pubmed:citationSubset
IM
pubmed:chemical
pubmed:status
MEDLINE
pubmed:issn
1793-5091
pubmed:author
pubmed:issnType
Print
pubmed:owner
NLM
pubmed:authorsComplete
Y
pubmed:pagination
202-13
pubmed:dateRevised
2007-9-12
pubmed:meshHeading
pubmed:year
1999
pubmed:articleTitle
Time and memory efficient algorithm for extracting palindromic and repetitive subsequences in nucleic acid sequences.
pubmed:affiliation
Institute of Medical Science, University of Tokyo, Japan.
pubmed:publicationType
Journal Article, Research Support, Non-U.S. Gov't