OpenMP Implementation of Parallel Longest Common Subsequence Algorithm for Mathematical Expression Retrieval

DOI10.1142/S0129626421500079zbMath1490.68088OpenAlexW3164859740MaRDI QIDQ5087088

Pavan Kumar Perepu

Publication date: 8 July 2022

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626421500079

zbMATH Keywords

parallel algorithmtime complexityOpenMPlongest common subsequencemathematical expression retrieval

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Information storage and retrieval of data (68P20) Algorithms on strings (68W32) Presentation and content markup for mathematics (68V25)

Uses Software

• SPICE
• MathWebSearch
• Mathfind
• Lucene

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel processing of biological sequence comparison algorithms
• Time-efficient parallel algorithms for the longest common subsequence and related problems
• OpenMP implementation of SPICE3 circuit simulator
• Math Search for the Masses: Multimodal Search Interfaces and Appearance-Based Retrieval
• Performance evaluation in content-based image retrieval: overview and proposals
• Substitution tree indexing
• A Search Engine for Mathematical Formulae
• An Approach to Mathematical Search Through Query Formulation and Data Normalization

This page was built for publication: OpenMP Implementation of Parallel Longest Common Subsequence Algorithm for Mathematical Expression Retrieval