An approximation algorithm for alphabet indexing problem

DOI10.1007/BFB0015403zbMath1512.68452MaRDI QIDQ6487939

Shinichi Shimozono

Publication date: 21 March 2023

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)

Related Items (1)

Alphabet indexing for approximating features of symbols

Cites Work

• Unnamed Item
• Unnamed Item
• A machine discovery from amino acid sequences by decision trees over regular patterns
• Optimization, approximation, and complexity classes
• Approximation algorithms for combinatorial problems
• .879-approximation algorithms for MAX CUT and MAX 2SAT
• On the Approximation of Maximum Satisfiability

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