2012
DOI: 10.5120/7774-0857
|View full text |Cite
|
Sign up to set email alerts
|

An Index based Pattern Matching using Multithreading

Abstract: Pattern matching, the problem of finding sub sequences within a long sequence is essential for many applications such as information retrieval, disease analysis, structural and functional analysis, logic programming, theorem-proving, term rewriting and DNA-computing. In computational biology the essential components for DNA applications is the exact string matching algorithms. Many databases like GenBank were built by researchers for DNA and protein sequences; the string matching problem is the core problem fo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…It stores all the index values of all characters and checks the first character of the pattern, which character appears first in the pattern as the starting matching position. Literature [ 8 ] proposes to establish index structure in DNA and protein sequences, design a multithread matching model based on DNA sequence index, match sequences of multiple tasks simultaneously and has high efficiency in DNA matching accuracy. Literature [ 9 ] proposes a hash function based on Hash-q to eliminate conflicts, providing a perfect and efficient hash value generation method.…”
Section: Introductionmentioning
confidence: 99%
“…It stores all the index values of all characters and checks the first character of the pattern, which character appears first in the pattern as the starting matching position. Literature [ 8 ] proposes to establish index structure in DNA and protein sequences, design a multithread matching model based on DNA sequence index, match sequences of multiple tasks simultaneously and has high efficiency in DNA matching accuracy. Literature [ 9 ] proposes a hash function based on Hash-q to eliminate conflicts, providing a perfect and efficient hash value generation method.…”
Section: Introductionmentioning
confidence: 99%