COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES

Autor: Muhammad Yusuf Muhammad, Mathias Fonkam, Salu George Thandekatu, Sandip Rakshit, Rao Narasimha Vajjhala

Publikováno v: Operational Research in Engineering Sciences: Theory and Applications, Vol 6, Iss 1 (2023)

The inherent parallelism in a bit operation like AND/OR inside a computer word is known as bit parallelism. It plays a greater role in string pattern matching and has good application in the analysis of biological data. The use of recently developed

Externí odkaz: https://doaj.org/article/2115a7cd782147cdaccd83f5b84ea37a

From Bit-Parallelism to Quantum String Matching for Labelled Graphs

Autor: Equi, Massimo, Meijer-van de Griend, Arianne, Mäkinen, Veli

Many problems that can be solved in quadratic time have bit-parallel speed-ups with factor $w$, where $w$ is the computer word size. A classic example is computing the edit distance of two strings of length $n$, which can be solved in $O(n^2/w)$ time

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1abb36486f92cce9a95effe0ed04012f

Internal shortest absent word queries in constant time and linear space

Autor: Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis

Publikováno v: CPM 2021-32nd Annual Symposium on Combinatorial Pattern Matching
CPM 2021-32nd Annual Symposium on Combinatorial Pattern Matching, Jul 2021, Wroclaw, Poland. pp.1-13
Badkobeh, G, Charalampopoulos, P, Kosolobov, D & Pissis, S P 2022, ' Internal shortest absent word queries in constant time and linear space ', Theoretical Computer Science, vol. 922, pp. 271-282 . https://doi.org/10.1016/j.tcs.2022.04.029
32nd Annual Symposium on Combinatorial Pattern Matching (CPM)
32nd Annual Symposium on Combinatorial Pattern Matching (CPM), 2021, Wroclaw, Poland
Theoretical Computer Science
Theoretical Computer Science, 922, 271-282. Elsevier
NARCIS
arXiv.org e-Print Archive
Hal-Diderot
Mémoires en Sciences de l'Information et de la Communication
Institutional repository of Ural Federal University named after the first President of Russia B.N.Yeltsin
Vrije Universiteit Amsterdam (VU Amsterdam)-Institutional Repository
INRIA a CCSD electronic archive server
Datacite
ORCID
Theoretical Computer Science, 922, 271-282

Comment: 13 pages, 1 figure, 4 tables
Given a string $T$ of length $n$ over an alphabet $\Sigma\subset \{1,2,\ldots,n^{O(1)}\}$ of size $\sigma$, we are to preprocess $T$ so that given a range $[i,j]$, we can return a representation of a shortes

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::904f48fbc81b6de749398a96836f8886
https://inria.hal.science/hal-03498358/file/2106.01763.pdf

Bit-Parallelism Score Computation with Multi Integer Weight

Autor: Setyorini Setyorini, Dwi H. Widyantoro, Adi Pancoro, Kuspriyanto Kuspriyanto

Publikováno v: International Journal on Electrical Engineering and Informatics. 11:35-50

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::1dcd86ca32805fac19449078e83eca1d
https://doi.org/10.15676/ijeei.2019.11.1.3

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.