Relevant bibliographies by topics / String matching algorithms / Dissertations / Theses
To see the other types of publications on this topic, follow the link: String matching algorithms.

Dissertations / Theses on the topic 'String matching algorithms'

Author: Grafiati
Published: 4 June 2021
Last updated: 14 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'String matching algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Cheng, Lok-lam, and 鄭樂霖. "Approximate string matching in DNA sequences." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B29350591.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

黎少斌 and Shiao-bun Lai. "Trading off time for space for the string matching problem." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31214216.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lai, Shiao-bun. "Trading off time for space for the string matching problem /." Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B18061795.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pockrandt, Christopher Maximilian [Verfasser]. "Approximate String Matching : Improving Data Structures and Algorithms / Christopher Maximilian Pockrandt." Berlin : Freie Universität Berlin, 2019. http://d-nb.info/1183675879/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Klaib, Ahmad. "Exact string matching algorithms for searching DNA and protein sequences and searching chemical databases." Thesis, University of Huddersfield, 2014. http://eprints.hud.ac.uk/id/eprint/24266/.

Full text
Abstract:
The enormous quantities of biological and chemical files and databases are likely to grow year on year, consequently giving rise to the need to develop string-matching algorithms capable of minimizing the searching response time. Being aware of this need, this thesis aims to develop string matching algorithms to search biological sequences and chemical structures by studying exact string matching algorithms in detail. As a result, this research developed a new classification of string matching algorithms containing eight categories according to the pre-processing function of algorithms and pro
APA, Harvard, Vancouver, ISO, and other styles
6

Ãvila, Ricardo Lima Feitosa. "Emprego de tÃcnicas de prÃ-processamento textual e algoritmos de comparaÃÃo como suporte à correÃÃo de questÃes dissertativas: experimentos, anÃlises e contribuiÃÃes." Universidade Federal do CearÃ, 2013. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10572.

Full text
Abstract:
CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior<br>Esta dissertaÃÃo apresenta um estudo de tÃcnicas que podem ser empregadas como apoio para a correÃÃo de questÃes dissertativas com base na adaptaÃÃo de algoritmos de comparaÃÃo textual combinados a tÃcnicas de prÃ-processamento de textos. O principal desafio na concepÃÃo de uma ferramenta para este tipo de aplicaÃÃo à a ambiguidade da linguagem natural. Para analisar situaÃÃes de correÃÃo de questÃes subjetivas, foram efetuados testes com esses algoritmos, tendo-se desenvolvido uma ferramenta para tal propÃsito. Confrontando respos
APA, Harvard, Vancouver, ISO, and other styles
7

Toth, Róbert. "Přibližné vyhledávání řetězců v předzpracovaných dokumentech." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236122.

Full text
Abstract:
This thesis deals with the problem of approximate string matching, also called string matching allowing errors. The thesis targets the area of offline algorithms, which allows very fast pattern matching thanks to index created during initial text preprocessing phase. Initially, we will define the problem itself and demonstrate variety of its applications, followed by short survey of different approaches to cope with this problem. Several existing algorithms based on suffix trees will be explained in detail and new hybrid algorithm will be proposed. Algorithms wil be implemented in C programmin
APA, Harvard, Vancouver, ISO, and other styles
8

Neto, Domingos Soares. "Filtros para a busca e extração de padrões aproximados em cadeias biológicas." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/.

Full text
Abstract:
Esta dissertação de mestrado aborda formulações computacionais e algoritmos para a busca e extração de padrões em cadeias biológicas. Em particular, o presente texto concentra-se nos dois problemas a seguir, considerando-os sob as distâncias de Hamming e Levenshtein: a) como determinar os locais nos quais um dado padrão ocorre de modo aproximado em uma cadeia fornecida; b) como extrair padrões que ocorram de modo aproximado em um número significativo de cadeias de um conjunto fornecido. O primeiro problema, para o qual já existem diversos algoritmos polinomiais, tem recebido muita atenção desd
APA, Harvard, Vancouver, ISO, and other styles
9

Dubois, Simon. "Offline Approximate String Matching forInformation Retrieval : An experiment on technical documentation." Thesis, Tekniska Högskolan, Högskolan i Jönköping, JTH. Forskningsmiljö Informationsteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-22566.

Full text
Abstract:
Approximate string matching consists in identifying strings as similar even ifthere is a number of mismatch between them. This technique is one of thesolutions to reduce the exact matching strictness in data comparison. In manycases it is useful to identify stream variation (e.g. audio) or word declension (e.g.prefix, suffix, plural). Approximate string matching can be used to score terms in InformationRetrieval (IR) systems. The benefit is to return results even if query terms doesnot exactly match indexed terms. However, as approximate string matchingalgorithms only consider characters (nor
APA, Harvard, Vancouver, ISO, and other styles
10

Frey, Jeffrey Daniel. "Finding Song Melody Similarities Using a DNA String Matching Algorithm." Kent State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=kent1208961242.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Momeninasab, Leila. "Design and Implementation of a Name Matching Algorithm for Persian Language." Thesis, Linköpings universitet, Interaktiva och kognitiva system, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-102210.

Full text
Abstract:
Name matching plays a vital and crucial role in many applications. They are for example used in information retrieval or deduplication systems to do comparisons among names to match them together or to find the names that refer to identical objects, persons, or companies. Since names in each application are subject to variations and errors that are unavoidable in any system and because of the importance of name matching, so far many algorithms have been developed to handle matching of names. These algorithms consider the name variations that may happen because of spelling, pattern or phonetic
APA, Harvard, Vancouver, ISO, and other styles
12

Silva, Júnior José Bonifácio da. "Paralelização em CUDA do algoritmo Aho-Corasick utilizando as hierarquias de memórias da GPU e nova compactação da Tabela de Transcrição de Estados." Universidade Federal de Sergipe, 2017. https://ri.ufs.br/handle/riufs/3353.

Full text
Abstract:
The Intrusion Detection System (IDS) needs to compare the contents of all packets arriving at the network interface with a set of signatures for indicating possible attacks, a task that consumes much CPU processing time. In order to alleviate this problem, some researchers have tried to parallelize the IDS's comparison engine, transferring execution from the CPU to GPU. This This dissertation aims to parallelize the Brute Force and Aho-Corasick string matching algorithms and to propose a new compression of the State Transition Table of the Aho-Corasick algorithm in order to make it possible to
APA, Harvard, Vancouver, ISO, and other styles
13

Yahiaoui, Said. "Algorithmes et applications pour la coloration et les alliances dans les graphes." Thesis, Lyon 1, 2013. http://www.theses.fr/2013LYO10274.

Full text
Abstract:
Dans cette thèse, nous nous intéressons aux aspects algorithmiques et applications de deux problèmes de graphes, à savoir, la coloration et les alliances. La première partie concerne deux variantes de la coloration de graphes, la coloration Grundy et la coloration forte stricte. Nous commençons par l'étude du nombre Grundy des graphes réguliers. Nous donnons une condition fixe k, nous fournissons une condition nécessaire et suffisante pour que le nombre Grundy d'un graphe régulier soit au moins égal k. Nous caractérisons la classe des graphes cubiques (3-réguliers) pour laquelle le nombre Grun
APA, Harvard, Vancouver, ISO, and other styles
14

Moradi, Arvin. "Smart Clustering System for Filtering and Cleaning User Generated Content : Creating a profanity filter for Truecaller." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-124408.

Full text
Abstract:
This thesis focuses on investigating and creating an application for filtering user-generated content. The method was to examine how profanity and racist expressions are used and manipulated to evade filtering processes in similar systems. Focus also went on to study different algorithms to get this process to be quick and efficient, i.e., to process as many names in the shortest amount of time possible. This is because the client needs to filter millions of new uploads every day. The result shows that the application detects profanity and manipulated profanity. Data from the customer’s databa
APA, Harvard, Vancouver, ISO, and other styles
15

Alex, Ann Theja. "Local Alignment of Gradient Features for Face Photo and Face Sketch Recognition." University of Dayton / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1353372694.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Martin, Benjamin. "Analyse de structures répétitives dans les séquences musicales." Thesis, Bordeaux 1, 2012. http://www.theses.fr/2012BOR14711/document.

Full text
Abstract:
Cette thèse rend compte de travaux portant sur l’inférence de structures répétitives à partir du signal audio à l’aide d’algorithmes du texte. Son objectif principal est de proposer et d’évaluer des algorithmes d’inférence à partir d’une étude formelle des notions de similarité et de répétition musicale.Nous présentons d’abord une méthode permettant d’obtenir une représentation séquentielle à partir du signal audio. Nous introduisons des outils d’alignement permettant d’estimer la similarité entre de telles séquences musicales, et évaluons l’application de ces outils pour l’identification autom
APA, Harvard, Vancouver, ISO, and other styles
17

Nosek, Ondřej. "Hardwarová akcelerace algoritmu pro hledání podobnosti dvou DNA řetězců." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2007. http://www.nusl.cz/ntk/nusl-236882.

Full text
Abstract:
Methods for aproximate string matching of various sequences used in bioinformatics are crucial part of development in this branch. Tasks are of very large time complexity and therefore we want create a hardware platform for acceleration of these computations. Goal of this work is to design a generalized architecture based on FPGA technology, which can work with various types of sequences. Designed acceleration card will use especially dynamic algorithms like Needleman-Wunsch and Smith-Waterman.
APA, Harvard, Vancouver, ISO, and other styles
18

Kuang, Hsueh Jui, and 薛睿光. "A Study on String-Matching Algorithms." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/45412037298316276441.

Full text
Abstract:
碩士<br>大同大學<br>應用數學研究所<br>91<br>In this thesis, we give experimental results on the performance of several popular string-matching algorithms. Meanwhile the behaviors of the costs of some variant Boyer-Moore algorithms are investigated. The costs considered include the numbers of character inspections, and the total time used.
APA, Harvard, Vancouver, ISO, and other styles
19

Shih, Hung-Te, and 施鴻德. "A Survey of String-Matching Algorithms." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/18193520008520957794.

Full text
Abstract:
碩士<br>逢甲大學<br>應用數學所<br>92<br>We study the algorithms for pattern matching, i.e., searching a query substring in a given string, which appears in the text processing, image processing, and other applications. The algorithms cover the Direct String-Matching algorithms, the Rabin-Karp algorithm, the Finite Automata, the Knuth-Morris-Pratt algorithm, the Boyer-Moore algorithm, etc. The time complexity, worst-case performance and the criteria for choosing these algorithms are also studied.
APA, Harvard, Vancouver, ISO, and other styles
20

Chen, Kuei-Hao, and 陳奎昊. "Improved Algorithms for Exact String Matching Problems." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/64377810416197972394.

Full text
Abstract:
博士<br>國立暨南國際大學<br>資訊工程學系<br>101<br>In this dissertation, we consider two problems: the exact string matching problem and its variation, the exact circular string matching. The exact string matching problem is: Given two strings, a text $T$ of length $n$ and a pattern $P$ of length $m$, find all occurrences of $P$ in $T$. We propose a strategy to analyze the average performance of the reverse factor algorithm. The analysis is based on the assumption that the text is very long as compared to the length of the pattern, and each symbol in the text is drawn uniformly from a random source with $sigm
APA, Harvard, Vancouver, ISO, and other styles
21

Lu, Chia Wei, and 呂嘉維. "Efficient Exact and Approximate String Matching Algorithms." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/49922113552090356808.

Full text
Abstract:
博士<br>國立清華大學<br>資訊工程學系<br>102<br>In this thesis, we first propose two algorithms for exact string matching problem, which aims to find all the positions i's in a given text where a given pattern occurs. Our algorithms find an optimal selective comparing order of the characters of the pattern so that we could have a better performance in the searching phase. To find the optimal comparing order, we adopt the branch and bound approach. Moreover, our proposed algorithm can be combined with other existing exact string matching algorithms to improve the searching efficiency. The experimental res
APA, Harvard, Vancouver, ISO, and other styles
22

Lu, Chia-Wei. "String Matching Algorithms Based upon the Uniqueness Property and an Approximate String Matching Algorithm Based upon the Candidate Elimination Method." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2406200815183100.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Lu, Chia-Wei, and 呂嘉維. "String Matching Algorithms Based upon the Uniqueness Property and an Approximate String Matching Algorithm Based upon the Candidate Elimination Method." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/17632385982720975496.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>96<br>In this thesis, we consider two problems, exact string matching and approximate string matching problem. The exact string matching problem is to determine all of the locations of a pattern string P appearing in a text string T. We first point out a uniqueness property of a given pattern. We then propose four algorithms to solve the exact string matching problem based upon the uniqueness property. Experimental results showed that three of our algorithms are faster than the KMP and Boyer-Moore algorithms. The approximate string matching problem is define
APA, Harvard, Vancouver, ISO, and other styles
24

Lin, Po-Ching, and 林柏青. "Accelerating String Matching Algorithms for Deep Packet Inspection." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/05808898005943344191.

Full text
Abstract:
博士<br>國立交通大學<br>資訊科學與工程研究所<br>96<br>An increasing number of network devices inspect the packet content for various signatures of security violation. Accelerating the process, namely deep packet inspection (DPI), can be in two aspects: algorithm and packet flow. This work focuses on the former. We first review existing string matching algorithms for DPI to see what work has been done and what should be addressed. In the review, we indicate the pros and cons of each algorithm, and a scalable, efficient design to meet the different characteristics of the pattern set in various applications i
APA, Harvard, Vancouver, ISO, and other styles
25

Huang, Lan-Ya. "An Exact String Matching Algorithms Using Hashing Scheme." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2406200814285000.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Huang, Lan-Ya, and 黃蘭雅. "An Exact String Matching Algorithms Using Hashing Scheme." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/16933370591311289241.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊管理學系<br>96<br>In this thesis, we consider how to solve the exact string matching problem. The exact string matching problem is to find all locations of a pattern string P in a text string T. In general, string matching algorithm problem work in linear time and linear space. The two well-known of them are Knuth-Morris-Pratt (KMP) algorithm and Boyer-Moore (BM) algorithm. We will use the hashing scheme to solve the exact string matching problem. Our method is simple to implement, and our algorithm work in constant space. Experimental shows that our algorithm is better th
APA, Harvard, Vancouver, ISO, and other styles
27

Chen, Hong-Chieh, and 陳宏杰. "A Review of String Matching Algorithms with Constant Space." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/77479923915180499277.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊管理學系<br>94<br>The string matching problem is to find all occurrences of a given pattern string P in a text string T. It is a classical and important problem in computer science and two well-known string matching algorithms are the Knuth-Morris-Pratt (KMP) algorithm and the Boyer-Moore (BM) algorithm and both of them work in linear time and linear space. Hence, designing a string matching algorithm with linear time cost and simultaneously constant space are interesting and usually sophisticated in the string matching problem. In recent years, many constant space and linea
APA, Harvard, Vancouver, ISO, and other styles
28

Holloway, James Lee. "Algorithms for string matching with applications in molecular biology /." 1992. http://hdl.handle.net/1957/11518.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Burkhardt, Stefan [Verfasser]. "Filter algorithms for approximate string matching / von Stefan Burkhardt." 2004. http://d-nb.info/972323015/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Li, Zhi-Xiang, and 李志祥. "Profiling and Accelerating String Matching Algorithms in Three Content Security Applications." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/24569832427268462905.

Full text
Abstract:
碩士<br>國立交通大學<br>資訊科學系所<br>93<br>Network content security has become a critical issue of the Internet. It is shown that the efficiency of string matching algorithms is essential to content processing. The performance of a string matching algorithm is sensitive to the number of patterns, the minimum length of the signature and the character set that the signatures are composed of. This work reviews and profiles some typical algorithms to understand which algorithm is suitable in which situation. The AC algorithm is suitable for LSP=1, the Modified-WM algorithm is suitable for LSP =2 when the pat
APA, Harvard, Vancouver, ISO, and other styles
31

Huang, Chun-cheng, and 黃俊程. "High-Performance Parallel Location-Aware Algorithms for Approximate String Matching on GPUs." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/5b596z.

Full text
Abstract:
碩士<br>國立臺灣師範大學<br>電機工程學系<br>105<br>Approximate string matching has been widely used in many applications, including deoxyribonucleic acid sequence searching, spell checking, text mining, and spam filters. The method is designed to find all locations of strings that approximately match a pattern in accordance with the number of insertion, deletion, and substitution operations. Among the proposed algorithms, the bit-parallel algorithms are considered to be the best and highly efficient algorithms. However, the traditional bit-parallel algorithms lacks the ability of identifying the start and end
APA, Harvard, Vancouver, ISO, and other styles
32

Shih-hsin, Liang, and 梁仕炘. "A K-modular String Matching Algorithm." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/19890631579529954123.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>98<br>Lots of string matching algorithms has been proposed. Among them, Boyer-Moore is fast but difficult to analyze its time complexity. The naive, or brute force, algorithm is the simplest string matching method. Its time complexity is O(m*n) when searching with a pattern of length m in a text of length n. Although Morris Pratt (MP) and Knuth-Morris-Pratt (KMP) algorithm method are very simple, and their time complexity is O(n), but every character must be checked at lease once. Colussi method, the one most peculiar method, divides its process into two step. The f
APA, Harvard, Vancouver, ISO, and other styles
33

Liu, Kuei-Wen. "Some Results on Exact String Matching Algorithm." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2406200814333600.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Hsu, Yu-Ling, and 徐玉玲. "An Efficient Real Scaled String Matching Algorithm." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/44140988949103322076.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>96<br>Text searching is used on a wide variety of technologies, such as computer science, multimedia library, web search, etc. This thesis proposes how to find all possible patterns that appear under the real scales in text. On our algorithm, we consider two cases of real scales. One of them contains the scale range is greater than or equal to 1. The other case contains the range is less than or equal to 1. By using the Real Scaled Indexing Tree (RSIT), we can determine whether a substring under every scale can match the text or not. Assume that the lengths of text
APA, Harvard, Vancouver, ISO, and other styles
35

Liu, Kuei-Wen, and 劉貴文. "Some Results on Exact String Matching Algorithm." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/14472736499752714951.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>96<br>In this paper, we introduce two algorithms for stringology. One is to solve the exact string matching problem and the other is to find the string cycle (period of a string). In the exact string matching problem, we are given two strings T=t1t2...tn and P=p1p2...pm. We are asked to find all occurrences of P in T. Our searching method is based upon a single character rule. Consider a location i in P. Suppose that pi is aligned with tj and pi <> tj. We then must move P in such a way that some pk=tj will be aligned with tj. In the thesis, we propose a
APA, Harvard, Vancouver, ISO, and other styles
36

Lo, Shiao Wen. "A Review of String Matching Algorithm without Tables." 2007. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2706200714045300.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Lo, Shiao-Wen, and 羅少文. "A Review of String Matching Algoritms without Tables." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/19999616183376766508.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>95<br>General string matching algorithms for string matching problem work in linear time and linear space. The two well-known famous of them are Knuth-Morris-Pratt (KMP) algorithm and Boyer-Moore (BM) algorithm. However, some string matching algorithms presented in recent years work in linear time and just need a small additional memory space. If such algorithms can work in linear time and simultaneously constant space, we call those algorithms as constant space string matching algorithms. In this thesis, we perform a review about constant space string matching a
APA, Harvard, Vancouver, ISO, and other styles
38

Chou, Chih-Chieh, and 周智杰. "A Fast String Matching Algorithm Based On Network Processor." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/25687177452147145028.

Full text
Abstract:
碩士<br>國立清華大學<br>資訊工程學系<br>92<br>With the development of high-speed network, uni-processor incapable of affording a large number of traffic can not satisfy what is required by high performance network equipments. It can help improve the performances. However, most network equipments such as network intrusion detection or protection systems need to inspect the packet content and compare with its own signatures, and react appropriately. Thus, the need for a faster algorithm for multi-pattern searching becomes more and more urgent. It is the most crucial factor concerned with the network performan
APA, Harvard, Vancouver, ISO, and other styles
39

Shieh, Yi-Kung. "An Improved Approximate String Matching Algorithm Based upon the Boyer-Moore Algorithm." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2406200816121600.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Shieh, Y. K., and 謝一功. "An Improved Approximate String Matching Algorithm Based upon the Boyer-Moore Algorithm." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/66121462520038468689.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>96<br>In this thesis, we discuss the exact string matching problem and approximate string matching problem. We avoid using a brute-force algorithm to solve the string matching problem. We improve the Bad Character Rule of Boyer and Moore Algorithm and compare it with the Horspool Algorithm. And we find that the improved method include the information of the Horspool Algorithm. Therefore, we combine the improved method with the Horspool Algorithm. The combinative method has a better efficiency in searching phase.
APA, Harvard, Vancouver, ISO, and other styles
41

Chu, Jia-Han, and 朱家漢. "Efficient Pattern Matching Algorithms for Variable-Length and Tolerant Strings." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/07175382319267136974.

Full text
Abstract:
碩士<br>國立臺灣海洋大學<br>資訊工程學系<br>92<br>In this thesis, a novel algorithm for searching common segments in multiple DNA or animo acid sequences is designed. To improve efficiency in pattern searching, combination of hashing encoding, quick sorting and ladderlike stepping and/or interval jumping techniques are applied. Since multiple sequence alignment of DNA or animo acid sequences from the giant genomic database is usually time consuming, we develop a three-phase methodology to search common sub-strings and reduce the time complexity in the comparison. In the first coding phase, DNA or animo aci
APA, Harvard, Vancouver, ISO, and other styles
42

Yen, Chen-Cheng. "A Combination of Berry Ravindran Algorithm and Two Way Algorithm for Exact String Matching." 2007. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2406200814134200.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Yen, Chen-Cheng, and 顏成哲. "A Combination of Berry Ravindran Algorithm and Two Way Algorithm for Exact String Matching." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/43753477020737174183.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>96<br>The exact string matching problem is defined as follows: We are given a text and a pattern , . Our purpose is to find all occurrences of in . It is a classical and important problem in computer science. In this thesis, we propose a new approach to solve this problem. Two Way algorithm and the Berry Ravindran algorithm are good algorithms which find all occurrences of in , but some problems still exist. If we consider the situation that the last two text characters of the window with size m are the same with that of , Berry Ravindran algorithm is not
APA, Harvard, Vancouver, ISO, and other styles
44

Chiu, Chi-Chang, and 邱啟彰. "Design a Two-Way Fast String-Matching Algorithm for Intrusion Detection System." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/86518049918252358632.

Full text
Abstract:
碩士<br>義守大學<br>資訊工程學系碩士班<br>96<br>As proliferation of Internet applications increases, security becomes a serious problem within network solutions. Intrusion detection systems (IDS) have become widely recognized as the most effective ways for identifying and thwarting all kinds of known network attacks. Because most of the known attacks can be represented with strings or combinations of multiple substrings, string matching is one of the most critical components in IDS. String matching must check every byte of every packet to see if it matches one of a set of ten thousand suspicious strings. As
APA, Harvard, Vancouver, ISO, and other styles
45

陳建麟. "A Parallel String Matching Algorithm for High Speed Network Intrusion Detection System." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/57773162720790226759.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Yang, Chao-Yuan, and 楊朝淵. "A New Algorithm for Solving the String Matching with k-Mismatches Problem." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/53970156684807658094.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>93<br>String matching with k-mismatches problem is defined as follows. Given a pattern P with length m, a text T with length n and an integer k, string matching with k-mismatches problem wants to find all occurrences of P on T with k maximal number of mismatches allowable. In this thesis, we propose a new algorithm to solve the problem. The algorithm uses the Kangaroo method mentioned in the paper by Galil and Giancarlo and that by Landau and Vishkin. Our algorithm and the Kangaroo Method are distinct from the number of steps to find mismatches. Each step in our al
APA, Harvard, Vancouver, ISO, and other styles
47

Liao, Chung-Yu, and 廖重淯. "A Novel Parallel Dual-Character String Matching Algorithm on Graphical Processing Units." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/mn6gb5.

Full text
Abstract:
碩士<br>國立臺灣師範大學<br>電機工程學系<br>105<br>Aho-Corasick algorithm has been widely used in network intrusion detection system to inspect network packets against thousands of attack patterns. To improve the performance of network intrusion detection systems, many variations of Aho-Corasick algorithm are proposed to accelerate multiple string matching on GPUs or dedicated hardware. One of the proposed variations is to increase the number of characters that are processed per cycle. However, increasing the number of characters processed per cycle will encounter two major problems. The first problem is the
APA, Harvard, Vancouver, ISO, and other styles
48

Liao, Kuei-Hui, and 廖桂慧. "Solving the Exact String Matching Problem by Using the 2-Substring Algorithm." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/46723272181241712677.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>生物醫學科技研究所<br>95<br>String matching is a very important component of many problems, such as data compression, search engine, speech recognition, virus detection, computational biology, and so on. There are many efficient method proposed to solve the string matching problem. For example, KMP algorithm、Boyer-and-Moore algorithm. In this thesis, we proposed a method to solve the exact string matching problem. We proposed a rule, called the 2-substring rule, which avoids the brute force method and can be used to solve the problem. We know the time complexity of KMP algorithm i
APA, Harvard, Vancouver, ISO, and other styles
49

Lin, Sheng-Yuan, and 林聖淵. "A High Performance Parallel Algorithm for Approximate String Matching on Multi-core Processor." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/96412144907123635479.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Zheng, Yi-Jun, and 鄭伊君. "A sub-linear time string matching algorithm with Bloom filters acceleration: Design, Implementation and Evaluation." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/25684296002946637638.

Full text
Abstract:
碩士<br>國立交通大學<br>資訊科學與工程研究所<br>94<br>Many network security applications heavily rely on string matching to detect malicious intrusions, viruses, spam, and so on. A software-based implementation may not meet the performance requirement of high-speed applications due to intensive computation and frequent memory accesses. A hardware solution to take advantage of hardware parallelism is a promising trend to inspect the packet payload at line rate. In this work, we propose an innovative memory-based architecture using Bloom filters to realize a sub-linear time algorithm that can effectively process
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography