Alphabet indexing for approximating features of symbols

Theoretical Computer Science

Volumn 210, Issue 2, 1999, Pages 245-260

  Shimozono, Shinichi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Alphabet indexing; Data compression; Knowledge acquistion; Nonapproximability; Polynomial time approximation

Indexed keywords

EID: 0008608908     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00088-7     Document Type: Article

References (24)

1. S. Abbasi, A. Sengupta, An O(n log n) algorithm for finding dissimilar strings, Inform Process. Lett. 62 (1997) 135-139.
2. S.E. Altschul, W. Gish, W. Miller, E.W. Mayers, D.J. Lipman, Basic local alignment search tool, J. Mol. Biol. 215 (1990) 403-410.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, in: Proc. 33rd Annual Symp. on Foundations of Computer Science, IEEE, 1992, pp. 14-23.
4. G. Ausiello, P. Crescenzi, M. Protasi, Approximate solution of NP optimization problems, Theoret. Comput. Sci. 150 (1995) 1-55.
5. M. Bellare, O. Goldreich, M. Sudan, Free bits, PCPs and non-approximability - towards tight results, in: Proc. 36th Annual Symp. on Foundations of Computer Science, IEEE, New York, 1995, pp. 422-431.
6. M.O. Dayhoff, R.M. Schwartz, B.C. Orcutt, A model of evolutionary change in proteins, in: Atlas of Protein Sequence and Structure, Ch. 22, National Biomedical Research Foundation, Washington, 1978, pp. 345-358.
7. M.X. Goemans, D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problem using semidefinite programming, J. Assoc. Comput. Mach. 42 (1995) 1115-1145.
8. S. Henikoff, J.G. Henikoff, Amino acid substitution matrices from protein blocks, Proc. Natl. Acad. Sci. USA 89 (1992) 10915-10919.
9. D.S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. Systems Sci. 9 (1974) 256-278.
10. P. Jokinen, E. Ukkonen, Two algorithms for approximate string matching in static texts, in: Proc. Mathematical Foundations in Computer Science, Springer, Berlin, 1991, pp. 240-248.
11. K. Karplus, Regularizers for estimating distributions of amino acids from small samples, Technical Report UCSC-CRL-95-11, University of California, Santa Cruz, 1995.
12. S. Khanna, R. Motwani, M. Sudan, U. Vazirani, On syntactic versus computational views of approximability, in: Proc. 35th Annual Symposium on Foundations of Computer Science, IEEE, New York, 1994, pp. 819-830.
13. J. Kyte, R.F. Doolittle, A simple method for displaying the hydropathic character of protein, J. Mol. Biol. 157 (1982) 105-132.
14. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1993.
15. C.H. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. Systems Sci. 43 (1991) 425-440.
16. J. Quinlan, Induction of decision trees, Machine Learning 1 (1986) 81-106.
17. S. Shimozono, An approximation algorithm for alphabet indexing problem, in: Proc. 6th Annual Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, vol. 1004, Springer, Berlin, 1995, pp. 2-11.
18. S. Shimozono, S. Miyano, Complexity of finding alphabet indexing, IEICE Trans. Inform Systems E78-D (1995) 13-18.
19. S. Shimozono, A. Shinohara, T. Shinohara, S. Miyano, S. Kuhara, S. Arikawa, Knowledge acquisition from amino acid sequences by machine learning system BONSAI, Trans. Inform Proc. Soc. Japan 35 (1994) 2009-2018.
20. T. Shinohara, Private communication, 1995.
21. R.F. Smith, T.F. Smith, Automatic generation of primary sequence patterns from sets of related protein sequences, Proc. Natl. Acad. Sci. USA 87 (1990) 118-122.
22. W.R. Taylor, The classification of amino acid conservation, J. Theoret. Biol. 119 (1986) 205-218.
23. W.J. Wilbur, D.J. Lipman, Rapid similarity searches of nucleic acid and protein data banks, Proc. Natl. Acad. Sci. USA 80 (1983) 726-730.
24. M. Yannakakis, On the approximation of maximum satisfiability, J. Algorithms 17 (1994) 475-502.