A programmable array processor architecture for flexible approximate string matching algorithms

DOI10.1016/J.JPDC.2006.10.002zbMATH Open1158.68552OpenAlexW1979787006MaRDI QIDQ866747FDOQ866747

Authors: Panagiotis D. Michailidis, Konstantinos G. Margaritis 

Publication date: 14 February 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.10.002

Recommendations

• A fast VLSI solution for approximate string matching
• scientific article; zbMATH DE number 2112398
• Data structures and algorithms for approximate string matching
• Faster approximate string matching
• Multiple approximate string matching

zbMATH Keywords

parallel architecturesVLSIFPGAapproximate string matchingparallel implementationsarray processors architectures

Mathematics Subject Classification ID

Searching and sorting (68P10) Approximation algorithms (68W25) Parallel algorithms in computer science (68W10)

Cited In (2)

• Title not available (Why is that?)
• A fast VLSI solution for approximate string matching

Uses Software

• MPI

This page was built for publication: A programmable array processor architecture for flexible approximate string matching algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866747)