Switch to
| Predicate | Object |
|---|---|
| rdf:type | |
| lifeskim:mentions | |
| pubmed:issue |
3
|
| pubmed:dateCreated |
1993-8-10
|
| pubmed:abstractText |
We consider the basic function which locates a specific string of symbols within a longer sequence. When one is expecting to do many substring searches it is worthwhile to build an auxiliary index to the sequence to aid in the search. We propose a method to generate a compact index that can be viewed as a small (partial) deterministic finite automaton recognizing the subword structure of a sequence. We present an algorithm for its construction on-line in linear time. Such a data structure permits the efficient localization of subwords in a sequence and can be used in the development of interactive sequence analysis software.
|
| pubmed:language |
eng
|
| pubmed:journal | |
| pubmed:citationSubset |
IM
|
| pubmed:status |
MEDLINE
|
| pubmed:month |
Jun
|
| pubmed:issn |
0266-7061
|
| pubmed:author | |
| pubmed:issnType |
Print
|
| pubmed:volume |
9
|
| pubmed:owner |
NLM
|
| pubmed:authorsComplete |
Y
|
| pubmed:pagination |
343-8
|
| pubmed:dateRevised |
2004-11-17
|
| pubmed:meshHeading |
pubmed-meshheading:8324635-Algorithms,
pubmed-meshheading:8324635-Automatic Data Processing,
pubmed-meshheading:8324635-Microcomputers,
pubmed-meshheading:8324635-Online Systems,
pubmed-meshheading:8324635-Pattern Recognition, Automated,
pubmed-meshheading:8324635-Programming, Linear,
pubmed-meshheading:8324635-Sequence Analysis
|
| pubmed:year |
1993
|
| pubmed:articleTitle |
The position end-set tree: a small automaton for word recognition in biological sequences.
|
| pubmed:affiliation |
Genosphere Project, ERATO, JRDC, Tokai University School of Medicine, Kanagawa, Japan.
|
| pubmed:publicationType |
Journal Article
|