Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

8 results for “string matching algorithm”
Set a search alert
Research ArticleOpen accessEvery word in the titleA Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search AlgorithmsAbdulwahab Ali AlmazroiProblem statement: String matching algorithm had been an essential means for searching biological sequence database. With the constant expansion in scientific data such as DNA and Protein; the development of enhanced algorithms have even become more critical as the major concern had always been how to raise the performances of these search algorithms to meet challenges of scientific information. Approach: … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,398 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Fast Hybrid Algorithm for the Exact String Matching ProblemAbdulwahab Ali Al-mazroi, Nur’Aini Abdul RashidProblem statement: Due to huge amount and complicated nature of data being generated recently, the usage of one algorithm for string searching was not sufficient to ensure faster search and matching of patterns. So there is the urgent need to integrate two or more algorithms to form a hybrid algorithm (called BRSS) to ensure speedy results. Approach: This study proposes … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 1 · 31 Jan 2011 · 8,240 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAnalysis of String Matching Compression AlgorithmsKrishnaveny Nadarajan, Zuriati A. ZukarnainThe improvement rate in microprocessor speed by far exceeds the improvement in DRAM memory. This increasing processor-memory performance gap is the primary obstacle to improved computer system performance. As a result, the size of main memory has increased gradually. To utilize main memory’s resources effectively, data compression can be applied. Through compression, the data can be compressed by eliminating redundant … …Journal of Computer Science, Vol. 4, Issue 3 · 31 Mar 2008 · 7,293 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleParallel Algorithms for String Matching Problem on Single and Two Dimensional Reconfigurable Pipelined Bus SystemsS. Viswanadha Raju, A. Vinaya BabuWe considered string matching on LARPBS and 2D LARPBS. This has applications such as string databases, cellular automata and computational biology. The main use of this method is to reduce the time spent on comparisons in string matching by using LARPBS. We investigated exact string matching and approximate string matching problems. For these two sub problems, we obtained O (n) … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,530 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Fast Pattern Matching Algorithm with Two Sliding Windows (TSW)Amjad Hudaib, Rola Al-Khalid, Dima Suleiman et al.In this research, we propose a fast pattern matching algorithm: The Two Sliding Windows (TSW) algorithm. The algorithm makes use of two sliding windows, each window has a size that is equal to the pattern length. Both windows slide in parallel over the text until the first occurrence of the pattern is found or until both windows reach the middle … …Journal of Computer Science, Vol. 4, Issue 5 · 31 May 2008 · 7,499 accessesView PDFCite
Research ArticleOpen accessIn the abstractIdentification of Pecan Weevils through Image ProcessingS.M. Al-Saqer, P. Weckler, J. Solie et al.Abstract: Problem Statement: Pecan weevil is one of the most destructive pests of Oklahoma. The scope of this study is to develop a recognition system that can serve in a wireless imaging network for monitoring pecan weevils. Approach: The recognition methods used in this study are based on template matching. Five recognition methods were implemented: Normalized cross-correlation, Fourier descriptors, Zernike … …American Journal of Agricultural and Biological Sciences, Vol. 6, Issue 1 · 15 Dec 2010 · 8,775 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Algorithm for Subset Matching ProblemYangjun ChenThe subset matching problem is to find all occurrences of a pattern string p of length m in a text string t of length n, where each pattern and text position is a set of characters drawn from some alphabet ∑. The pattern is said to occur at text position i if the set p[j] is a subset of the … …Journal of Computer Science, Vol. 3, Issue 12 · 31 Dec 2007 · 6,737 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Fast Approximate String Searching AlgorithmMahmoud Mhashi, Adnan Rawashdeh, Awni HammouriIn both approximate and exact string searching algorithms, the shift distance at the skipping step plays a major role in the performance of string matching algorithms. A new algorithm called the Modified Character-Weight Algorithm (MWA) has been developed to test the effect of the shift distance on the performance of approximate string matching. An experiment was performed comparing the performance … …Journal of Computer Science, Vol. 1, Issue 3 · 30 Sep 2005 · 6,907 accessesView PDFCite