Light-based string matching

DOI10.1007/S11047-007-9033-0zbMATH Open1192.68203OpenAlexW2064437094WikidataQ58609903 ScholiaQ58609903MaRDI QIDQ835975FDOQ835975

Authors: Larry Pier Luca Mihai Oltean 

Publication date: 31 August 2009

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-007-9033-0

Recommendations

• scientific article; zbMATH DE number 826050
• String Processing and Information Retrieval
• scientific article; zbMATH DE number 872102
• A very fast string matching algorithm based on condensed alphabets
• Fast string matching for multiple searches

zbMATH Keywords

string matchinglight-based computing

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• An optical model of computation
• Speeding up two string-matching algorithms
• A fast string searching algorithm
• The Boyer–Moore–Galil String Searching Strategies Revisited
• Fast Pattern Matching in Strings
• On the Exact Complexity of String Matching: Lower Bounds
• On the Exact Complexity of String Matching: Upper Bounds
• Leibniz's dynamics and optics
• Rainbow sort: Sorting at the speed of light
• Correctness and efficiency of pattern matching algorithms
• Tighter Lower Bounds on the Exact Complexity of String Matching
• A Light-Based Device for Solving the Hamiltonian Path Problem
• A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm

Cited In (2)

• On the complexity of nonuniform wavelength-based machine
• Solving the generalized subset sum problem with a light based device

This page was built for publication: Light-based string matching

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