String Matching Algorithms

Writing matching has evolved dramatically from simple string comparison algorithms to sophisticated natural language processing techniques. This comprehensive literature review examines matching methods over the last 20 years, with special emphasis on transitioning from traditional frameworks to modern NLP methods to identify opportunities for practical theoretical integration and development exploring both models' fundamental principles, strengths and limitations. Our systematic review covers three main areas: (1) classical text matching algorithms, including Levenstein distance, Boyer-Moore, and Knuth-Morris-Pratt; (2) modern NLP techniques, such as transformer-based models and contextual ontologies; and (3) emerging hybrid approaches that seek to integrate these approaches. Intensive analysis of more than 40 papers from leading areas in information retrieval, natural language processing, and algorithmic evolution reveals key patterns in adopting text-matching strategies and highlights promising directions for future research. The study highlights a significant difference between the computational efficiency of traditional methods and the logical comprehension capabilities of modern NLP methods. Our study examines various attempts to bridge this gap and discusses the challenges and opportunities in integrating classical and modern approaches. We examine how different approaches manage the trade-off between computational complexity, logical clarity, and application-specific requirements.

This paper presents an industrial-grade intelligent purification system for industrial wastewater, integrated as a single-file unified SCADA (Supervisory Control and Data Acquisition) solution with comprehensive functional modules. The system merges five core components, including SCADA enterprise foundation, chemical dosing control, micropollutant monitoring, energy-carbon accounting, and industrial wastewater treatment data interfaces, covering 19 key functional modules such as Modbus TCP-based PLC/RTU integration, PID-controlled chemical dosing (PAC/PAM/carbon source/pH adjustment), tamper-proof ledger with TPM 2.0/HMAC dual-signature, Scope 1/2/3 carbon accounting, Weibull-based predictive maintenance, and MLOps framework for model management.

Built on authentic national/international standards (HJ/GB/EPA/IPCC), the system features standardized water quality detection methods, industrial-grade process parameters, and region-specific carbon emission factors. It supports two operational modes (synthetic simulation for testing and Modbus TCP for on-site deployment) and provides complete deployment tools, including hardware-in-the-loop (HIL) testing scenarios, parameter calibration templates, and network security partitioning plans.

With a code framework completion rate of 90% (~3,000 lines), the system requires on-site commissioning of critical parameters (Modbus register mapping, PID tuning, chemical dosing coefficients) for optimal performance. It is open-source without copyright or patent restrictions, enabling free adaptation across environmental protection fields. The system’s modular design and integration capability lay a foundation for future fusion of multiple systems, aiming to address core challenges in industrial wastewater treatment through infinite integration and sublimation of functional advantages.

Due to the huge surge of digital information and the task of mining valuable information from huge amount of data, text processing tasks like string search has gained importance. Earlier techniques for text processing relied on following some predetermined sequence of steps or some hard coded rules. However, these techniques might soon prove to be inefficient as the amount of data generated by modern computer systems in increasing more and more. One solution to this problem lies in the development of intelligent algorithms that incorporate a certain degree of intelligence and unlike traditional algorithm are able to cope up with changing scenarios. This paper presents a string searching algorithm that incorporates a certain degree of intelligence to search for a string in a text. In the search of a string, the algorithm relies on a chance process and a certain probability at each step. An analysis of the algorithm based on the approach suggested by A. A. Markov is also presented in the paper. The expected number of average comparisons required for searching a string in a text is computed. Based on the varieties of applications that are coming up in the area of text processing and the related fields, this new algorithm aims to find its use.

In this paper, we propose "stable marriages" algorithms based on a novel representation called marriage table. After explaining how properties as global satisfaction, sex equality and stability show in the representation, we define 3 algorithms corresponding to 3 different scans of the marriage table to meet progressively all constraints. The performance is evaluated in front of the population size for 200 instances in each case. That supports qualitative statistic analysis. Two matching examples in image processing are displayed for illustration.

String manipulation and pattern-matching algorithms are fundamental components of computational science, playing a vital role in fields such as bioinformatics, web search engines, cybersecurity, and natural language processing. Algorithms like Brute-Force, Knuth-Morris-Pratt (KMP), Boyer-Moore, and Rabin-Karp provide diverse capabilities tailored to specific data types and performance requirements. Recent advancements, including hybrid approaches and machine learning integration, have enhanced the efficiency and applicability of these algorithms in real-world scenarios. However, challenges such as scalability, noise tolerance, and resource limitations persist, necessitating further innovation. The continuous evolution of computational sciences, fueled by advancements in parallel processing and artificial intelligence, presents vast opportunities for the future enhancement and novel applications of string manipulation and pattern-matching algorithms. These developments hold the promise of solving increasingly complex tasks across diverse domains.

ABSTRAK Dengan meningkatnya jumlah pengguna dan konten di Snack Video, sistem pencarian yang cepat dan relevan sangat dibutuhkan. Algoritma string matching digunakan untuk mencocokkan query pengguna dengan konten secara efisien, sedangkan algoritma greedy mempercepat proses dengan memilih solusi terbaik secara iteratif. Penelitian ini bertujuan untuk mengevaluasi implementasi kedua algoritma ini dalam meningkatkan akurasi dan kecepatan pencarian serta relevansi rekomendasi di SnackVideo.

A string matching algorithm aims to find one or several occurrences of a string within another. String matching is a classical problem in computer science. Our approach presents an elementary and efficient algorithm. First, we find some index values of pattern of length m from text T, the algorithm returns the position of the first character of the desired substring in the text. In second phase it matches whether the substring at this index value matches the actual pattern P. The algorithm works in linear time, if the number of occurrences of the pattern in a string is very less.

Figure 1: A subset of shapes from the benchmark. Participants are required to produce a point-wise correspondence (either sparse or dense) between a full template in a neutral pose (left) and its deformed versions with missing parts. The dataset includes 8 shape classes, for a total of 599 3D models. In this figure corresponding points have the same color, while shape boundaries are marked by a red contour.

Saat ini alat-alat telekomunikasi telah berkembang di Indonesia, salah satu alat telekomunikasi yang sangat pesat perkembangannya saat ini adalah alat telekomunikasi berbasis mobile. Mobile adalah suatu sistem operasi untuk perangkat Android yang berbasis Linux. AL-Qur'an adalah kitab suci yang memuat hadist-hadist yang dijadikan sumber pengambilan hukum fikih (istinbath) oleh para ahli fikih. Kitab ini, juga menjadi rujukan utama khususnya dari fikih dari Mazhab Syafi'i. Karena jumlah Hadist yang tidak sedikit, saat ini Hadist sudah terhimpun bukan satu Hadist saja tetapi sudah ribuan. Maka bagi si pembacapun tidak akan membawa semua buku Hadistnya ketika keluar rumah, dikarenakan Kitab suci berfisik tebal, berbahasa Arab serta belum dilengkapi terjemahan. Sehingga, si pembacapun akan kesusahan untuk mencari masalah mengenai hukum-hukum islam. Proses pencarian merupakan salah satu kegiatan penting dalam pemrosesan data. Proses ini dapat menghabiskan waktu dalam ruang pencarian yang besar sehingga diperlukan suatu teknik pencarian yang efisien. Algoritma Bitap dan Algoritma Zhu takaoka merupakan suatu solusi pencarian yang efisien dapat melakukan perbandingan pattern mulai dari kanan ke kiri. Jika terjadi ketidakcocokan string dari kanan pattern maka ketidakcocokan akan membantu kita untuk menggerakkan pattern tersebut dengan jarak yang lebih jauh. Algoritma Bitap dan Algoritma Zhu takaoka mempunyai keunggulan dalam waktu menemukan pattern yang akan dicari dalam ukuran file yang lebih besar.

Digital dictionary of medicinal plants a collection of applications a collection of names of medicinal plants. This application was developed to make it easier for users to access the use of medicinal plants based on keywords, names of common diseases such as asthma, diarrhea, fever, headache, diabetes, and so on. The obstacle in using the digital dictionary application of medicinal plants is that it is difficult to find exact information on drug searches, because the vocabulary in producing several other items is not necessarily the same as what is being sought. This study uses the Knuth Morris Pratt (KMP) algorithm search technique on a digital dictionary of medicinal plants by matching keywords as input with strings between text and patterns. This study aims to develop previous research on a digital dictionary of medicinal plants using a mobile-based Rocchio algorithm that searches medicinal plant data by querying proximity in a database that has weaknesses in words that have the...

In terms of finding the problem topic for thesis titles, students often have difficulty in determining thesis titles, in addition, there may be similarities between students. Manually checking the title requires more effort, for it takes a system to detect the level of similarity in the thesis title. To design and build a thesis title-level detection system using the Knuth-Morris-Pratt algorithm. To find out the percentage of similarities in the title, the Knuth-Morris-Pratt algorithm at the time of matching the string is Enter query of the word to be searched, matching the word arrangement pattern used as an example at the beginning of the text. From left to right, this algorithm will match character per character pattern with characters in the corresponding text, the algorithm then shifts the wording pattern until the word arrangement pattern used as an example is at the end of the text. Based on the analysis, design and implementation of the similarity level detection system of t...

Saat ini alat-alat telekomunikasi telah berkembang di Indonesia, salah satu alat telekomunikasi yang sangat pesat perkembangannya saat ini adalah alat telekomunikasi berbasis mobile. Mobile adalah suatu sistem operasi untuk perangkat Android yang berbasis Linux. AL-Qur'an adalah kitab suci yang memuat hadist-hadist yang dijadikan sumber pengambilan hukum fikih (istinbath) oleh para ahli fikih. Kitab ini, juga menjadi rujukan utama khususnya dari fikih dari Mazhab Syafi'i. Karena jumlah Hadist yang tidak sedikit, saat ini Hadist sudah terhimpun bukan satu Hadist saja tetapi sudah ribuan. Maka bagi si pembacapun tidak akan membawa semua buku Hadistnya ketika keluar rumah, dikarenakan Kitab suci berfisik tebal, berbahasa Arab serta belum dilengkapi terjemahan. Sehingga, si pembacapun akan kesusahan untuk mencari masalah mengenai hukum-hukum islam. Proses pencarian merupakan salah satu kegiatan penting dalam pemrosesan data. Proses ini dapat menghabiskan waktu dalam ruang pencarian yang besar sehingga diperlukan suatu teknik pencarian yang efisien. Algoritma Bitap dan Algoritma Zhu takaoka merupakan suatu solusi pencarian yang efisien dapat melakukan perbandingan pattern mulai dari kanan ke kiri. Jika terjadi ketidakcocokan string dari kanan pattern maka ketidakcocokan akan membantu kita untuk menggerakkan pattern tersebut dengan jarak yang lebih jauh. Algoritma Bitap dan Algoritma Zhu takaoka mempunyai keunggulan dalam waktu menemukan pattern yang akan dicari dalam ukuran file yang lebih besar.

The Kamus Besar Bahasa Indonesia (KBBI) application is a software or application that allows users to access and search for the meaning of a single word in Indonesian along with its spelling. Indonesian has a complex morphological structure, where words can change form through affixation (addition of prefixes or suffixes), reduplication, or internal changes that create many dialectal variations and spelling variations that can affect word forms and writing patterns. This causes a variety of words that are similar but different in writing. On the other hand, that the Indonesian Dictionary application needs speed and accuracy of word searches then the program makes adjustments to those in the dictionary. Therefore, researchers analyze based on the data that has been obtained by the KBBI application using string matching (brute force) and regular expression algorithms. Researchers hope that the algorithms that have been analyzed can help solve problems in the KBBI application in conduc...

The strategy of packing several data values in a single computer word and refreshing them all in a solitary operation is referred to bit parallelism. It assumes a significant part in pattern matching because it can handle in parallel the length of pattern sizes. In this paper, an Improved Pattern Matching model (IPM) proposed, which makes searching process quicker and decreases how much memory used in processing input data. C# was used for the development of the model. With a computer word size of 64bits and pattern length ranging from 8 characters to 72 characters, the system decides how much memory is used. The developed model was evaluated and contrasted with the existing model using 64bits computer word size (cws) and the pattern length of 72 characters. The assessment showed that the IPM had minimal worth of MU contrasted with the existing model (BNDM, SBNDM, and FSBNDM). This IPM model can be embraced for improvement of the size of string data stored in computer word because o...

Bahasa daerah merupakan salah satu bahasa dari keanekaragaman bangsa Indonesia termasuk bahasa minang. Untuk itu diperlukan sebuah Aplikasi Kamus Bahasa Minang khususnya dalam hal menterjemah kata dari bahasa Indonesia kedalam bahasa minang. Program aplikasi ini dibuat dan dikembangkan dengan perangkat lunak PHP, dengan adanya Program aplikasi kamus bahasa minang ini dapat lebih mudah dalam proses mencari kosa kata dari bahasa Indonesia ke bahasa minang. Sehingga pengguna akan dapat menghemat biaya dan waktu, hasil dari perancangan aplikasi ini diharapkan dapat membantu pengguna dalam memahami bahasa minang.

Algoritma adalah urutan langkah logis yang digunakan untuk menyelesaikan suatu masalah. Singkatnya, sebuah masalah harus diselesaikan dengan beberapa Langkah logis. Dalam kehidupan sehari-hari, contoh algoritma bias digambarkan dengan berbagai macam hal/aktivitas. Sementara itu dalam ilmu computer matematika, algoritm di definisikan sebagai prosedur dari berbagai macam langkah perhitungan, penalaran otomatis, sampai pemrosesan data. Algoritma juga diartikan sebagai metofe yang diekspresikan lewat rangkaian dan instruksi yang di jabarkan untuk menghitung. Saecara garis besar, algoritma dimulai dengan input dan kondisi awal, deskripsi, eksekusi dan menghasilkan output.String matching adalah suatu algoritma yang digunakan untuk memecahkan masalah pencocokan suatu teks terhadap suatu teks lain. Disini penulis akan mencoba mengimplementasikan string matching untuk mencari suatu teks dalam beberapa dokumen agar memudahkan proses pencarian serta waktu jadi lebih efisien.Algoritma pencarian (searching algorithm) adalah algoritma yang menerima sebuah argument kunci dan dengan langkah-langkah tertentu akan mencari rekaman dengan kunci tersebut. Setelah proses pencarian dilaksanakan, akan diperoleh salah satu dari dua kemungkinan, yaitu data yang dicari ditemukan (succesfull) atau tidak ditemukan (unsuccesfull). Ada dua macam teknik pencarian yaitu pencarian skuensial (sequential search) dan pencarian biner (binary search). Perbedaan dari teknik ini terletak pada keadaan data. Pencarian skuensial digunakan apabila data dalam keadaan acak atau tidak terurut. Sebaliknya pencarian biner digunakan pada data yang sudah dalam keadaan urut. String matching merupakan salah satu algoritma yang bersifat fleksibel dan banyak diaplikasikan dalam beberapa program komputer karena dapat disesuaikan dengan kebutuhan spesifik pengguna. Metode string matching juga merupakan salah satu metode yang efektif untuk menemukan kemunculan kata atau pola pada teks. String matching juga dapat diimplementasikan dengan mudah meskipun kemampuannya yang relatif sederhana. Pencarian teks dalam koleksi dokumen merupakan proses menemukan dan mengindentifikasi dokumen yang mengandung informasi atau kata kunci tertentu. Dalam pencarian tersebut penulis menggunakan metode string matching. Namun keberhasilan pencarian juga bergantung pada keakuratan metode yang digunakan serta kemampuannya untuk menangani kompleksitas dokumen dan variasi kueri pengguna. Selain itu, pencarian teks dalam koleksi dokumen juga telah banyak dikembangkan oleh beberapa perusahaan teknologi ternama seperti WPS Office dan Ms Word.

Penelitian ini bertujuan untuk melakukan pencarian data maintenace secara cepat yang terkirim melalui email di storage komputer melalui bantuan metode pencarian query. Pencarian manual yang dilakukan selama ini menjadi issue lamanya penanganan pencarian data maintenance sehingga menghambat flow bussiness berikutnya. Penanganan yang berjalan selama ini adalah dengan menggunakan proses searcing tool konvensional dan memerlukan banyak penggunaan sumber daya yang ada baik aspek sumberdaya manusia dan waktu dalam menagani satu trouble shooting yang berdampak pula pada bengkaknya biaya operasional yang ada. Sehingga diperlukan suatu metode pencarian yang lebih layak. Metode pencarian query tersebut adalah metode yang menggunakan string matching yang dalam pengoperasiannya mampu memangkas waktu pencarian data hingga 50% lebih cepat daripada metoda semula sehingga penyelesaian tugas dapat tertangani dengan segera.

In general, most fingerprint recognition systems are based on the minutiae feature points. When matching two fingerprint images, the goal in most recognition systems is to find the optimal transformation model that aligns their feature points in order to find among them the number of matched or aligned points and then generate a matching score. A major problem in feature extraction stage is that when the fingerprint image is of a poor quality due to skin conditions and sensor noise, that leads to many broken ridges in the image caused by cutline. In this case, the extraction of minutiae leads to a lot of spurious points and the performance of the system will degrade. Usually, image enhancement techniques are applied as preprocessing step to overcome this problem. In this work, we propose to use corner points on fingerprint ridges as new features in addition to the ridges minutiae in order to improve the recognition performance. Every ridge is decomposed into several straight edges (SEs). A straight edge is defined as a straight link of ridge points. On a ridge, the head of the first straight edge and the tail of the last one are two minutia and the intersections of the SEs are the ridge corners. Thus, we propose to use a ridge as primitive rather than individual points for matching. This primitive is a structure consisting of groups of both feature points which are minutiae and corners belonging to the same ridge. Based on this primitive, an intelligent matching technique is introduced using sets of feature points on the same primitive. As a result, the recognition performance is increased since it is based on ridge primitive matching rather than individual minutiae matching. Finally, our experimental results compared with those obtained by other well-known techniques in the literature demonstrate the effectiveness and efficiency of our proposed algorithm.

Kemajuan inovatif yang cepat saat ini membuatnya sangat mudah bagi kami untuk menangani berbagai masalah. Salah satu perangkat yang digunakan untuk menangani masalah tersebut adalah PC atau komputer. Bagaimana PC bisa menangani masalah kita? Karena tentunya PC tidak bisa bekerja secara alami tanpa ada yang menggerakkan dan mengisi PC tersebut. Cara penggunaan PC cenderung digunakan untuk menangani masalah dengan perhitungan dan bahasa pemrograman. Masalah itu bisa kita atasi dengan mengikuti langkah-langkah teratur membuat program yang berisi perhitungan di dalamnya. Perhitungan adalah premis rekayasa perangkat lunak yang berkonsentrasi pada metode yang paling mahir untuk mengatasi masalah dengan memiliki pilihan untuk mencari dan menggunakan dialek pemrograman. Setiap masalah yang diselesaikan menggunakan PC harus menggunakan perhitungan sebagai bahasa pemrograman. Alat-alat ini dapat dibuat dengan dokumentasi apa pun asalkan sederhana karena tidak ada dokumentasi standar yang dire...

The availability of various string-matching algorithm raises the concern of finding the one with the best performance. With the growth of digital content, especially a text-based content, using an optimal algorithm is crucial to decrease the cost of performing a task. There are numerous studies using a specific content to evaluate the performance of ones algorithm. In this paper, we chose two commonly used string-matching algorithm; Reverse Colussi and Raita and compare the performance of these algorithm in finding text in Indonesian language. We specifically use Indonesian songs lyrics as our samples. To perform the test, we build and textbased song finder Android application. Our test result shows that Raita outperformed Reverse Colussi in most of the cases. This finding is due to the requirement of Reverse Colusi algoritm to have pre-processing step before performing the search.

The Kamus Besar Bahasa Indonesia (KBBI) application is a software or application that allows users to access and search for the meaning of a single word in Indonesian along with its spelling. Indonesian has a complex morphological structure, where words can change form through affixation (addition of prefixes or suffixes), reduplication, or internal changes that create many dialectal variations and spelling variations that can affect word forms and writing patterns. This causes a variety of words that are similar but different in writing. On the other hand, that the Indonesian Dictionary application needs speed and accuracy of word searches then the program makes adjustments to those in the dictionary. Therefore, researchers analyze based on the data that has been obtained by the KBBI application using string matching (brute force) and regular expression algorithms. Researchers hope that the algorithms that have been analyzed can help solve problems in the KBBI application in conduc...

Tujuan penelitian ini untuk menerapkan sebuah algoritma pada sebuah aplikasi kamus pencarian informasi mengenai sistem manajemen basis data bagi para programmer yang akan mempelajari mengenai konsep dari Da-ta Base Management System (DBMS). Aplikasi tersebut menggunakan sebuah algoritma brute force, dimana algo-ritma tersebut digunakan untuk melakukan pencarian antara pola dan teks pada sebuah aplikasi pencarian ber-basis web. Metode penelitian yang digunakan adalah kombinasi antara metode penelitian kuantitatif dan kuali-tatif, sedangkan pengembangan perangkat lunak menggunakan pendekatan prototype. Hasil penelitian ini adalah sebuah algoritma brute force yang dapat digunakan untuk menyelesaikan masalah pencarian kamus istilah DBMS dengan sederhana, mudah dipahami dalam penerapannya, lebih efektif untuk data yang terbatas, source code yang dihasilkan sedikit dan menghasilkan algoritma yang dapat dieksekusi untuk beberapa masalah seperti pen-cocokan dan pencarian.

Tujuan penelitian ini untuk menerapkan sebuah algoritma pada sebuah aplikasi kamus pencarian informasi mengenai sistem manajemen basis data bagi para programmer yang akan mempelajari mengenai konsep dari Da-ta Base Management System (DBMS). Aplikasi tersebut menggunakan sebuah algoritma brute force, dimana algo-ritma tersebut digunakan untuk melakukan pencarian antara pola dan teks pada sebuah aplikasi pencarian ber-basis web. Metode penelitian yang digunakan adalah kombinasi antara metode penelitian kuantitatif dan kuali-tatif, sedangkan pengembangan perangkat lunak menggunakan pendekatan prototype. Hasil penelitian ini adalah sebuah algoritma brute force yang dapat digunakan untuk menyelesaikan masalah pencarian kamus istilah DBMS dengan sederhana, mudah dipahami dalam penerapannya, lebih efektif untuk data yang terbatas, source code yang dihasilkan sedikit dan menghasilkan algoritma yang dapat dieksekusi untuk beberapa masalah seperti pen-cocokan dan pencarian.

The base language is one of the regional languages used in Aceh Province, precisely in Southeast Aceh. The base language is basically divided into 3 (three) pieces of dialeg, namely upstream (subtle), middle (medium), and downstream (rough). As time goes on, the Alas language becomes increasingly forgotten because the younger generation prefers to learn foreign languages to keep up with the times so that many Alas communities, especially the younger generation, cannot communicate using the Alas language. To preserve the Alas language, a technology-based dictionary application is needed that is developing at this time to help young people learn the Alas language. Improving the accuracy of string matching in translating the Alas language into Indonesian in the application in the dictionary application used to study the Alas language in this study used the Turbo Boyer Moore string matching agorithm. The results of this study are in the form of desktop-based applications that can be use...

Metode pencocokan string banyak digunakan pada fungsi pencarian dalam sebuah sistem informasi. Salah satu sistem informasi yang membutuhkan metode ini adalah sistem informasi pengajuan judul skripsi, dikarenakan judul skripsi yang diajukan harus bersifat unik atau tidak boleh sama dengan judul skripsi yang sudah ada. Penelitian ini melakukan studi perbandingan terhadap dua buah metode exact string matching yaitu dengan sequential searching dan kondisi Like pada SQL yang diterapkan pada fitur pencarian judul skripsi pada sistem informasi pengajuan judul skripsi Program Studi Sistem Informasi Fakultas Teknik, Universitas Bengkulu. Kedua metode ini mencocokkan string pada record yang telah ditentukan berdasarkan keyword yang di-input. Sequential searching mencocokkan data dengan membuat array pada semua data judul skripsi yang telah diajukan, sedangkan kondisi Like membaca semua data pada tabel judul skripsi. Hasil penelitian menununjukkan, kedua metode menunjukkan hasil yang sama pada...

: The functional and structural relationship of the biological sequence is determined by similarities in that sequence. Pursuing of similarity among biological sequences is an important research area that can bring insight into the evolutionary and genetic relationships among the genes. This paper will present a critical review of different multiple sliding window based pattern matching algorithms, which are Two Sliding Window (TSW), Enhanced Two Sliding Window (ETSW) and Four Sliding Window (FSW). All these algorithms are variations of Berry-Ravindran algorithm. This review provides insight into determining the efficient sliding window based algorithm. An algorithm with less number of character comparisons and less number of passes in proportion is the one that provides good result.

In determining the research topic as well as the title for the Thesis / TA, it is possible that there will be a similarity in the title between one student and another, whether intentionally or unintentionally. For this reason, the Study Program must check the titles submitted by students, so as to avoid indications of similar titles and indications of plagiarism. Efforts that can be made to make it easier to check the Thesis title are by performing string matching on the text on the title that will be submitted by students. One of the string matching algorithms is Boyer-Moore. Boyer-Moore, who made the match starting from the rightmost character then left based on the value of the occurrence heuristic (HO) and match heuristic (MH) in determining the shift. This research produces a system that is able to determine the similarity of the proposed Thesis titles based on the existing title repositories. From the results of testing the processing time by entering 100 and its multiples sh...

Wireless sensor network nodes supporting multi-tasking and multiple concurrent applications are becomingincreasingly common. These nodes are typically equipped withmultiple sensors of various types. This trend has been fosteringthe design of wireless sensor networks allowing several concurrent users to deploy applications with dissimilar requirements.At the same time, the practical burden of programmingindividual sensor nodes has led researchers to design macro-programming schemes able to program the network as a whole.In this paper, we extend the advantages of a holistic programming scheme by designing a novel compiler-assisted schedulingapproach (dubbed REIS) able to identify and eliminate redundancies across applications. To achieve this useful high-leveloptimization, we propose to model each user application as alinear sequence of executable instructions; we show how it isthen possible to exploit well-known string-matching algorithmssuch as the Longest Common Subsequence (LCS) and theShortest Common Super-sequence (SCS) to produce an optimalmerged sequence of the multiple applications that takes intoaccount embedded scheduling information. We demonstratehow this novel approach leads to significant network-wideresource savings, including energy.

Bahasa merupakan sarana untuk berkomunikasi. Di dunia ini banyak sekali bahasa, antara lain bahasa Indonesia dan Jawa. Pengetahuan tentang bahasa sangatlah penting karena dalam sebuah percakapan atau pembicaraan memerlukan sebuah bahasa. Sarana untuk mempelajari bahasa yaitu dengan menggunakan kamus. Ada banyak sekali jenis kamus mulai dari kamus berbentuk buku sampai berbentuk aplikasi mobile phone, akan tetapi jika ingin mempelajari bahasa dapat memakai aplikasi kamus Jawa Indonesia berbasis android yang menyediakan layanan untuk menterjemahkan kosakata. Tujuan pembuatan aplikasi kamus yaitu guna membantu pengguna dalam mempermudah pencarian kosakata dalam bahasa Jawa dan Indonesia.Berdasarkan hasil uji, aplikasi Kamus Jawa Indonesia dengan Metode Raita Berbasis Android ini hanya untuk mencari kosakata saja, aplikasi memuat menu tambah data dan edit data untuk menambah dan mengedit data apabila ada kesalahan. Aplikasi Kamus Jawa Indonesia Berbasis Android ini dapat dijalankan pada...

Sejalan dengan perkembangan teknologi informasi, hal itu mendorong setiap sekolah terutama bidang tata usaha untuk meningkatkan dan mengembangkan setiap informasi yang disajikan untuk menunjang pelayanan yang lebih baik. Tata usaha merupakan bagian sekolah yang memiliki wewenang menangani pengarsipan dokumen. Pengelolaan data pengarsipan dokumen di SMA Plus N 17 Palembang masih menggunakan cara manual yang akan diarsipkan dilemari arsip. Pada saat-saat tertentu terkendala dimana suatu dokumen yang sudah dibuat bertumpuk-tumpuk dengan jumlah yang banyak akan mengalami kesulitan untuk ditemukan. Pemasalahan tersebut maka terdapat tiga persoalan utama dalam penelitian ini yakni pembuatan sistem fitur pencarian pengarsipan dokumen oleh admin atau staff TU dan penerapan algoritma Knuth Morris Pratt (KMP). Algoritma KMP adalah pencocokan string yang melakukan perbandingan karakter teks dan karakter pattern. Algoritma ini adalah bagaimana memanfaatkan karakter-karakter pattern yang sudah d...

In this study, the changes in the performance of the string matching algorithms when they are used with different natural languages are searched. For this purpose, 8 different text corpuses which are the same in size are prepared for 8 different natural ...

The comparison of genomic sequences plays a key role in determining the structural and functional relationships between genes. This comparison is carried out by identifying the similarities, differences and mutations between genomic sequences. This makes it possible to study and analyze the genetic and the evolutionary relationships between organisms. Alignment algorithms have been in the spotlight for the last few decades, due to a vast genomic data explosion. They have attracted a great deal of interest from many researchers who focus on the development of practical solutions to ensure effective alignments with an optimal response time. In this paper, a novel algorithm based on Discrete To Continuous "DTC" approach has been developed. The proposed methodology was compared against other existing methods, which are largely based on the concept of string matching. Experimental results show that the DTC algorithm delivers supremely efficient alignment with a reduced response time.

At numerous phases of the computational process, pattern matching is essential. It enables users to search for specific DNA subsequences or DNA sequences in a database. In addition, some of these rapidly expanding biological databases are updated on a regular basis. Pattern searches can be improved by using high-speed pattern matching algorithms. Researchers are striving to improve solutions in numerous areas of computational bioinformatics as biological data grows exponentially. Faster algorithms with a low error rate are needed in real-world applications. As a result, this study offers two pattern matching algorithms that were created to help speed up DNA sequence pattern searches. The strategies recommended improve performance by utilizing word-level processing rather than character-level processing, which has been used in previous research studies. In terms of time cost, the proposed algorithms (EFLPM and EPAPM) increased performance by leveraging word-level processing with large pattern size. The experimental results show that the proposed methods are faster than other algorithms for short and long patterns. As a result, the EFLPM algorithm is 54% faster than the FLPM method, while the EPAPM algorithm is 39% faster than the PAPM method.

Pattern matching is a highly useful procedure in several stages of the computational pipelines. Furthermore, some research trends in this research domain contributed to growing biological databases and updated them throughout time. This article proposes an comparison and analysis of different algorithms for match equivalent pattern matching like complexity, efficiency, and techniques. Which algorithm is best for which DNA sequence and why? This describes the different algorithms for various activities that include pattern matching as an important aspect of functionality. This article shows that BM, Horspool, ZT, QS, FS, Smith, and SSABS methods employ the bad character preprocessing function. In addition, BM, SSABS, TVSBS, and BRFS methods are using two approaches in the preprocessing stage, which decreases the preprocessing time. Furthermore, KR, QS, SSABS, BRFS, and Shift-Or are not recommended for the long pattern, whereas ZT, FS, d-BM, Raita, and Smith are not recommended for the short pattern. This is because they are time-consuming and certain algorithms, such as ZT and DCPM, use a lot of time and space during the matching and search process, while others, such as d-BM and TSW, save space and time. Although DCPM, BRFS, and QS are quicker than other algorithms, FLPM, PAPM, and LFPM rank highest in terms of complexity time.

Sejalan dengan perkembangan teknologi informasi, hal itu mendorong setiap sekolah terutama bidang tata usaha untuk meningkatkan dan mengembangkan setiap informasi yang disajikan untuk menunjang pelayanan yang lebih baik. Tata usaha merupakan bagian sekolah yang memiliki wewenang menangani pengarsipan dokumen. Pengelolaan data pengarsipan dokumen di SMA Plus N 17 Palembang masih menggunakan cara manual yang akan diarsipkan dilemari arsip. Pada saat-saat tertentu terkendala dimana suatu dokumen yang sudah dibuat bertumpuk-tumpuk dengan jumlah yang banyak akan mengalami kesulitan untuk ditemukan. Pemasalahan tersebut maka terdapat tiga persoalan utama dalam penelitian ini yakni pembuatan sistem fitur pencarian pengarsipan dokumen oleh admin atau staff TU dan penerapan algoritma Knuth Morris Pratt (KMP). Algoritma KMP adalah pencocokan string yang melakukan perbandingan karakter teks dan karakter pattern. Algoritma ini adalah bagaimana memanfaatkan karakter-karakter pattern yang sudah d...

Dictionary is a reference that contains words and phrases that are usually sorted alphabetically and is followed by a description of the word or phrase. Dictionary consists of several types, one of which is a dictionary of terms. Psychology dictionary is a dictionary of terms that contain psychological term. Psychology dictionary is identical to the old tome in search and less efficient in its use. Made an Android-based application of psychology dictionary that applies the Horspool algorithm for terms search and SQLite for data storage is a solution. The search algorithm is needed to shorten the time in the search itself. Horspool algorithm apply a saved search information to shift even further because the string matching is done from right to left, so the time to search a string is shorter. Fields used in this research is psychology in general terms. By entering a psychological term as input in the search then we will get the search results. The results of this research show the en...

The main aim of this paper is to develop an accurate, fast and very efficient automatic attendance system using fingerprint verification technique. We propose a system in which fingerprint verification is done by using extraction of minutiae technique and the system that automates the whole process of taking attendance, Manually which is a laborious and troublesome work and waste a lot of time, with its managing and maintaining the records for a period of time is also a burdensome task. For this purpose we use fingerprint verification system using extraction of minutiae techniques. The experimental result shows that our proposed system is highly efficient in verification of user fingerprint.

This study aims to compare the performance of Boyer-Moore, Knuth morris pratt, and Horspool algorithms in searching for the meaning of words in the Java-Indonesian dictionary search application in terms of accuracy and processing time. Performance Testing is used to test the performance of algorithm implementations in applications. The test results show that the Boyer Moore and Knuth Morris Pratt algorithms have an accuracy rate of 100%, and the Horspool algorithm 85.3%. While the processing time, Knuth Morris Pratt algorithm has the highest average speed level of 25ms, Horspool 39.9 ms, while the average speed of the Boyer Moore algorithm is 44.2 ms. While the complexity test results, the Boyer Moore algorithm has an overall number of n 26n 2 , Knuth Morris Pratt and Horspool 20n 2 each.

Translator is a tool to assist in translating a language from another language. Translator is very useful for tourists when traveling to other countries or other regions that do not understand the language of the country or area visited. Translator is also very useful for a student or student to learn and add knowledge about foreign languages that are not understood. The availability of translators in a university to improve services for students or those who need them. Students don't all understand foreign languages. String matching is a search technique in a text that is often called string search. String matching is often used in text search, location search, dictionary and so on. String matching has several algorithms, including brute force, boyer moore, knuth morris pratt and many more algorithms contained in string mathing. The Indonesian to English translator application uses the string mathing brute force algorithm. Brute force algorithm is matching each character from l...

The main aim of this paper is to develop an accurate, fast and very efficient automatic attendance system using fingerprint verification technique. We propose a system in which fingerprint verification is done by using extraction of minutiae technique and the system that automates the whole process of taking attendance, Manually which is a laborious and troublesome work and waste a lot of time, with its managing and maintaining the records for a period of time is also a burdensome task. For this purpose we use fingerprint verification system using extraction of minutiae techniques. The experimental result shows that our proposed system is highly efficient in verification of user fingerprint.

Penelitian ini bertujuan untuk melakukan pencarian data maintenace secara cepat yang terkirim melalui email di storage komputer melalui bantuan metode pencarian query. Pencarian manual yang dilakukan selama ini menjadi issue lamanya penanganan pencarian data maintenance sehingga menghambat flow bussiness berikutnya. Penanganan yang berjalan selama ini adalah dengan menggunakan proses searcing tool konvensional dan memerlukan banyak penggunaan sumber daya yang ada baik aspek sumberdaya manusia dan waktu dalam menagani satu trouble shooting yang berdampak pula pada bengkaknya biaya operasional yang ada. Sehingga diperlukan suatu metode pencarian yang lebih layak. Metode pencarian query tersebut adalah metode yang menggunakan string matching yang dalam pengoperasiannya mampu memangkas waktu pencarian data hingga 50% lebih cepat daripada metoda semula sehingga penyelesaian tugas dapat tertangani dengan segera.

The lack of preservation is also the knowledge of the Pakpak Language in Indonesia, which causes the Pakpak Language to be less preserved, especially for young people who continue to keep abreast of the times. This causes the process of globalization and urbanization which causes assimilation and acculturation, especially in urban areas. This situation triggers a new language that is very popular, especially for young people who unconsciously, it makes us lose our identity as a society that has tribes and customs each – and the emergence of international and national schools that require students to speak foreign languages. Therefore, learning is needed to preserve Pakpak Language. By making a Pakpak to Indonesian translator application that uses the Android Based Boyer Moore algorithm. This translator application was made for the introduction of the PakpakLangugae to the wider community so that the sustainability of the Pakpak Language is maintained and this translator application ...

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 attempts as well as in the character comparisons with original algorithms in the first step and with recent and standard algorithms (i.e., Horspool, Quick search, Two-way, Fast search, SSABS, TVSBS, AKRAM, and Maximum shift) in the second step. The proposed algorithm in this study utilized several data types, namely, DNA sequences, Protein sequences, XML structures, Pitch characters, English texts, and Source codes. The Pitch database was the best match for Atheer in terms of the number of comparison attempts involving long and short patterns; the DNA database was the worst match. In terms of the character comparisons, the best database was the Source code database; the DNA sequence data type was also the worst match when short and long patterns were used.

The base language is one of the regional languages used in Aceh Province, precisely in Southeast Aceh. The base language is basically divided into 3 (three) pieces of dialeg, namely upstream (subtle), middle (medium), and downstream (rough). As time goes on, the Alas language becomes increasingly forgotten because the younger generation prefers to learn foreign languages to keep up with the times so that many Alas communities, especially the younger generation, cannot communicate using the Alas language. To preserve the Alas language, a technology-based dictionary application is needed that is developing at this time to help young people learn the Alas language. Improving the accuracy of string matching in translating the Alas language into Indonesian in the application in the dictionary application used to study the Alas language in this study used the Turbo Boyer Moore string matching agorithm. The results of this study are in the form of desktop-based applications that can be use...