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...

Full description

Saved in:

Bibliographic Details
Published in:	The Journal of supercomputing Vol. 79; no. 8; pp. 9093 - 9126
Main Authors:	Sadiq, Muhammad Umair, Yousaf, Muhammad Murtaza
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.05.2023 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!