The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] alphabet indexing(1hit)

1-1hit
  • Complexity of Finding Alphabet Indexing

    Shinichi SHIMOZONO  Satoru MIYANO  

     
    PAPER-Algorithm and Computational Complexity

      Vol:
    E78-D No:1
      Page(s):
    13-18

    For two finite disjoint sets P and Q of strings over an alphabet Σ, an alphabet indexing for P, Q by an indexing alphabet Γ with |Γ||Σ| is a mapping :ΣΓ satisfying (P)(Q), where :Σ*Γ* is the homomorphism derived from . We defined this notion through experiments of knowledge acquisition from amino acid sequences of proteins by learning algorithms. This paper analyzes the complexity of finding an alphabet indexing. We first show that the problem is NP-complete. Then we give a local search algorithm for this problem and show a result on PLS-completeness.