Comparison of Exact String Matching Algorithms for Biological Sequences

نویسندگان

  • Petri Kalsi
  • Hannu Peltola
  • Jorma Tarhio
چکیده

Exact matching of single patterns in DNA and amino acid sequences is studied. We performed an extensive experimental comparison of algorithms presented in the literature. In addition, we introduce new variations of earlier algorithms. The results of the comparison show that the new algorithms are efficient in practice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms for pattern matching and discovery in RNA secondary structure

Text-indexing structures provide significant advantages in the solution of many problems related to string analysis and comparison, and are nowadays widely used in the analysis of biological sequences. In this paper, we present some applications of affix trees to problems of exact and approximate pattern matching and discovery in RNA sequences. By allowing bidirectional search for symmetric pat...

متن کامل

A New Efficient Hybrid Exact String Matching Algorithm and Its Applications

String matching is one of most challenging issues in computer science. In this study, a new efficient hybrid string matching algorithm called Atheer was developed. This proposed algorithm is integrated with the excellent properties of three algorithms, namely, the Karp–Rabin, Raita, and Smith algorithms. The Atheer algorithm demonstrated an efficient performance in the number of comparison atte...

متن کامل

Java Tools to Help Understanding Pattern Matching Techniques

AppletButton Window Program level generic AppletButtonX WindowAUX ProgramCode level speci c WindowProg ProgramSPM Program level Figure 2: General architecture of the di erent systems From one application to another, the algorithms arborescence does not need to be modi ed. For \Exact String Matching Algorithms" a class ProgramSPM is derived form ProgramCode and the classical algorithms are deriv...

متن کامل

An Index based Pattern Matching using Multithreading

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 li...

متن کامل

A Comparative Study on String Matching Algorithm of Biological Sequences

String matching algorithm plays the vital role in the Computational Biology. The functional and structural relationship of the biological sequence is determined by similarities on that sequence. For that, the researcher is supposed to aware of similarities on the biological sequences. Pursuing of similarity among biological sequences is an important research area of that can bring insight into ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008