An approximation algorithm for alphabet indexing problem

DOI10.1007/BFB0015403zbMATH Open1512.68452MaRDI QIDQ6487939FDOQ6487939

Authors: Shinichi Shimozono 

Publication date: 21 March 2023

Recommendations

• Alphabet indexing for approximating features of symbols
• scientific article; zbMATH DE number 2185640
• scientific article; zbMATH DE number 2011852
• Compressed indexes for approximate string matching
• String matching with alphabet sampling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Algorithms on strings (68W32)

Cites Work

• Approximation algorithms for combinatorial problems
• Optimization, approximation, and complexity classes
• Title not available (Why is that?)
• Title not available (Why is that?)
• .878-approximation algorithms for MAX CUT and MAX 2SAT
• On the Approximation of Maximum Satisfiability
• A machine discovery from amino acid sequences by decision trees over regular patterns

Cited In (1)

• Alphabet indexing for approximating features of symbols

This page was built for publication: An approximation algorithm for alphabet indexing problem

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