Research ArticleOpen accessIn the keywordsGenome Sequence Analysis: A SurveyHassan Mathkour, Muneer AhmadProblem statement: Sequence analysis problems are NP hard and need optimal solutions. Interesting problems include duplicate sequence detection, sequence matching by relevance, sequence analysis using approximate comparison in general or using tools i.e., Matlab and multi-lingual sequence analysis. The usefulness of these operations is highlighted and future expectations are described. Approach: This study described the concepts, tools, methodologies, algorithms being … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Sep 2009 · 6,830 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA 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
Research ArticleOpen accessIn the abstractMatching LSI for Scalable Information RetrievalRajagopal Palsonkennedy, T. V. GopalLatent Semantic Indexing (LSI) is one of the well-liked techniques in the information retrieval fields. Different from the traditional information retrieval techniques, LSI is not based on the keyword matching simply. It uses statistics and algebraic computations. Based on Singular Value Decomposition (SVD), the higher dimensional matrix is converted to a lower dimensional approximate matrix, of which the noises could … …Journal of Computer Science, Vol. 8, Issue 12 · 2 Jan 2013 · 6,668 accessesView PDFCite
Research ArticleOpen accessIn the abstractParallel 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