Parallel DNA Sequencing using Exact String-Matching Algorithms for Multiple Patterns

String matching algorithms are used to find specific patterns within a larger file or sequence. They are extensively used in bioinformatics, molecular biology, and information retrieval. With the world of data at our fingertips, the aim is to accelerate its processing. This study focuses on applying...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International Conference in Information, Communication and Automation Technologies (Online) s. 1 - 6
Hlavní autori: Terzic, Dzenana, Pita, Naida, Becirspahic, Nejla, Muhic, Dzenis
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 02.09.2025
Predmet:
Bioinformatics
Brute Force
Burrows-Wheeler transform
CUDA
DNA
exact
FM Index
Force
Frequency modulation
Indexes
parallel
Pattern matching
Sequential analysis
Sorting
String-matching
Suffix Array
Testing
Time complexity
Transforms
ISSN:2643-1858
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:String matching algorithms are used to find specific patterns within a larger file or sequence. They are extensively used in bioinformatics, molecular biology, and information retrieval. With the world of data at our fingertips, the aim is to accelerate its processing. This study focuses on applying two distinctive parallel approaches to multiple substring matching in DNA. A Brute Force and FM Index algorithm are implemented, and their strengths and weaknesses are discussed based on experiments conducted on real genome sequences.
ISSN:2643-1858
DOI:10.1109/ICAT66432.2025.11189285