On the k-closest substring and k-consensus pattern problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3109, Issue , 2004, Pages 130-144

  Jiao, Yishan ^a   Xu, Jingyi ^a   Li, Ming ^b  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Closest string and substrings; Consensus pattern; K center problems; Polynomial time approximation scheme

Indexed keywords

LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS; PATTERN MATCHING;

CLOSEST SUBSTRING PROBLEMS; CLUSTERING PROBLEMS; CONSENSUS PATTERNS; CONSENSUS-PATTERN PROBLEM; K-CENTER PROBLEM; POLYNOMIAL TIME APPROXIMATION SCHEMES; SUB-STRINGS; TRANSFORMATION TECHNIQUES;

POLYNOMIAL APPROXIMATION;

EID: 35048870115     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_10     Document Type: Article

References (16)

1. A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis: Linear Approximation of Shortest Superstrings. Journal of the ACM. 41(4) (1994) 630-647
2. J. Buhler: Efficient large-scale sequence comparison by locality-sensitive hashing. Bioinformatics 17 (2001) 419-428
3. T. Feder and D. H. Greene: Optimal algorithms for approximate clustering. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (1988) 434-444
4. R.J. Fowler, M.S. Paterson and S.L. Tanimoto: Optimal packing and covering in the plane are NP-complete. Inf. Proc. Letters 12(3) (1981) 133-137
5. M.R. Garey and D. S. Johnson: The rectilinear Steiner tree problem is NP-complete. SIAM J.Appl.Math. 32 (1977) 826-834
6. L. Gasieniec, J. Jansson, and A. Lingas: Efficient approximation algorithms for the Hamming center problem. Proc. 10th ACM-SIAM Symp. on Discrete Algorithms (1999) S905-S906
7. L. Gasieniec, J. Jansson, and A. Lingas: Approximation Algorithms for Hamming Clustering Problems. Proc. 11th Symp. CPM. (2000) 108-118
8. T. F. Gonzalez: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38 (1985) 293-306
9. P. Indyk, R. Motwani: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. Proc. 30th Annual ACM Symp. Theory Comput. (1998) 604-613
10. J. Jansson: Consensus Algorithms for Trees and Strings. Doctoral dissertation (2003)
11. K. Lanctot, M. Li, B. Ma, L. Wang and L. Zhang: Distinguishing string selection problems. Proc. 10th ACM-SIAM Symp. Discrete Algorithms (1999) 633-642
12. M. Li, B. Ma, and L. Wang: Finding similar regions in many strings. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (1999) 473-482
13. M. Li, B. Ma, and L. Wang: On the Closest String and Substring Problems. Journal of ACM. 49(2) (2002) 157-171
14. B. Ma: A polynomial time approximation scheme for the Closest Substring problem. In Proc. 11th Annual Symposium on Combinatorial Pattern Matching (2000) 99-107
15. R. Motwani and P.Raghavan: Randomized Algorithms. Cambridge Univ. Press (1995)
16. R. Ostrovsky and Y. Rabani: Polynomial-Time Approximation Schemes for Geometric Min-Sum Median Clustering. Journal of ACM. 49(2) (2002) 139-156