On approximation algorithms for local multiple alignment

Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB

Volumn , Issue , 2000, Pages 1-7

  Akutsu, Tatsuya ^a   Arimura, Hiroki ^a   Shimozono, Shinichi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DNA SEQUENCES; ERROR ANALYSIS; PROTEINS; SORTING;

GIBBS SAMPLING ALGORITHMS;

MOLECULAR ORIENTATION;

EID: 0033691588     PISSN: None     EISSN: None     Source Type: None    
DOI: 10.1145/332306.332311     Document Type: Conference Paper

References (16)

1. S. Arora, C Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and hardness of approximation algorithms. Proc. 33rd IEEE Syrup. Foundatwns of Computer Sczence (FOCS'92), 14-23, 1992.
2. G. Ausiello, P. Crescenzi and M. Protasi. Approximate solution of NP optimization problems Theoretzeal Computer Sczenee, 150:1-55, 1995.
3. G. Ausiello, P. Crescenzi, G. Gambosi, V Kann, A. M. Spaccamela and M. Protasi. Complexity and Approxzmatzon. Combmatomal Optzm,zatzon Problems and thezr Approxzmabdzty Propertzes, Springer-Verlag, Berlin, 1999
4. V Bafna, E. Lawler and P Pevzner. Approximation algorithms for multiple sequence alignment. Proc. 5-th Syrup. Combznatomal Pattern Matchzng (CPM'94), 43-53, 1994
5. R. Durbm, S. Eddy, A. Krough and G Mltchlson Bwlogzcal Sequence Analysis Probabzlzstzc Models of Proterns and Nuclezc Aczds, Cambridge Umv Press, 1998
6. D. Gusfield. Efficient method for multple sequence alignment with guaranteed error bounds. Bull Math Bzol., 55-141-154, 1993
7. P Horton A branch and bound algorithm for local multiple ahgnment. Proc. Pacific Symp. Bzoeomputzng '96 (PSB'96), 368-383, 1996.
8. P. Horton New algorithms for multiple sequence alignment. Teehnzcal Report, 98-MPS-22-6, Information Processing Society of Japan, 1998.
9. J. Hudak and M.A Mcclure A comparative analysis of computational motif-detection methods Proc Pacific Symp Biocomputing '99 (PSB'99), 138-149, 1999.
10. C E. Lawrence and A A. Reilly. An expectation maximization (EM) algorithm for identification and characterization of common sites in unahgned biopolymer sequences. PROTEINS: Structure, Funetzon, and Genetics, 7'41-51, 1990.
11. C.E. Lawrence, S.F. Altschul, M.S. Boguski, J.S. Lm, A.F. Neuwald and J.C. Wootton. Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Sezenee, 262.208-214, 1993.
12. M. Li, B. Ma and L. Wang. Finding similar regions in many strings. Proc. 30th A CM Syrup. Theory of Computing (STOC'99), 473-482, 1999.
13. C.H. Papadlmitriou and M. Yannakakis. Optimization, approximatton, and complexity classes. J. Computer and System Sczenees, 43:425-440, 1991.
14. G. Stormo and G.W. Hartzell. Identifying proteinbinding sites from unaligned DNA fragments. Nucleic Aczds Research, 86:1183-1187, 1989.
15. G Stormo Consensus patterns in DNA. Methods m Enzymology, 183.211-221, 1990.
16. L. Wang and T. Jiang. On the complexity of multiple sequence alignment. J. Comp. Bzol., 1:337-348, 1994.