Complexity of Finding Alphabet Indexing

  title={Complexity of Finding Alphabet Indexing},
  author={Shinichi Shimozono and Satoru Miyano},
  journal={IEICE Transactions},
For two nite disjoint sets P and Q of strings over an alphabet , an alphabet indexing for P;Q by an indexing alphabet with j j < j j is a mapping : ! satisfying ~ (P ) \ ~ (Q) = ;, where ~ : ! is the homomorphism derived from . We de ned this notion through experiments of knowledge acquisition from amino acid sequences of proteins by learning algorithms. This paper analyzes the complexity of nding an alphabet indexing. We rst show that the problem is NP-complete. Then we give a local search… CONTINUE READING