Space-efficient computation of parallel approximate string matching

Approximate string matching (ASM) has a number of applications in many disciplines, ranging from information retrieval to gene matching. Conventional solution to this problem is based on the dynamic programming-based strategy having quadratic space and time complexity. The complexity of the conventi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	The Journal of supercomputing Ročník 79; číslo 8; s. 9093 - 9126
Hlavní autori:	Sadiq, Muhammad Umair, Yousaf, Muhammad Murtaza
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.05.2023 Springer Nature B.V
Predmet:	Algorithms Approximate string matching Compilers Complexity Computer Science Dynamic programming Gene sequencing Information retrieval Interpreters Processor Architectures Programming Languages Run time (computers) Performance evaluation Parallel algorithm Dynamic programming Approximate string matching OpenMP GPUs
ISSN:	0920-8542, 1573-0484
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!