Ming Li, Bin Ma  Home/Search
Context Related
| csd.uwo.ca/~bma/pub/jacm.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: csd.uwo.ca/~bma/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The problem of finding a center string that is `close' to every given string arises in computational molecular biology and coding theory. This problem has two versions: the Closest String problem and the Closest Substring problem. Given a set of strings S = fs 1 ; s 2 ; : : : ; s n g, each of length m, the Closest String problem is to find the smallest d and a string s of length m which is within Hamming distance d to each s i 2 S. This problem comes from coding theory when we are looking for ... (Update)
Cited by: More
Fixed-Parameter Algorithms for Closest String - And Related Problems (Correct)
Hardness results for the center and median string problems.. - Nicolas, Rivals (2005) (Correct)
PatternHunter II: Highly Sensitive and Fast Homology Search - Li, Ma, Kisman, Tromp (2003) (Correct)
Active bibliography (related documents): More All
1.3: Finding Similar Regions In Many Strings - Li, Ma, Wang (1999) (Correct)
0.9: Finding Similar Regions in Many Sequences - Ming Li University (1999) (Correct)
0.5: Distinguishing String Selection Problems - Lanctot, Li, Ma, Wang, Zhang (1999) (Correct)
Similar documents based on text: More All
1.0: A Polynomial Time Approximation Scheme for the Closest Substring.. - Ma (2000) (Correct)
0.9: Closest Strings, Primer Design, and Motif Search - Gramm, Hüffner, Niedermeier (2002) (Correct)
0.6: Exact Solutions for Closest String and Related Problems - Gramm, Niedermeier.. (2001) (Correct)
Related documents from co-citation: More All
4: Cambridge University Press (context) - Motwani, Raghavan - 1995
4: for approximating set cover (context) - Feige, of - 1996
4: Approximation Algorithms for NP-hard Problems (context) - Hochbaum - 1997
BibTeX entry: (Update)
M. Li, B. Ma, and L. Wang. On the Closest String and Substring Problems. Journal of the ACM, 49(2):157--171, 2002. http://citeseer.ist.psu.edu/li02closest.html More
@article{ li02closest,
author = "Ming Li and Bin Ma and Lusheng Wang",
title = "On the closest string and substring problems",
journal = "Journal of the ACM",
volume = "49",
number = "2",
pages = "157-171",
year = "2002",
url = "citeseer.ist.psu.edu/li02closest.html" }
Citations (may not include all citations):218 Probabilistic construction of deterministic algorithms: Appr.. (context) - Raghavan - 1988
149 Polynomial time approximation schemes for dense instances of.. - Arora, Karger et al. - 1995
132 Randomized Algorithms (context) - Motwani, Raghavan - 1995
46 Computational molecular biology -- an algorithmic approach (context) - Pevzner - 2000
42 Efficient methods for multiple sequence alignment with guara.. (context) - Gusfield - 1993
39 Algorithms on Strings (context) - Gusfield - 1997
24 algorithm for the identification and characterization of com.. (context) - Lawrence, Reilly et al. - 1990
23 Pattern recognition in several sequences: consensus and alig.. (context) - Waterman, Arratia et al. - 1984
22 Identification of consensus patterns in unaligned DNA and pr.. (context) - Hertz, Stormo - 1995
22 A workbench for multiple alignment construction and analysis (context) - Schuler, Altschul et al. - 1991
21 Identifying protein-binding sites from unaligned DNA fragmen.. (context) - Stormo - 1991
19 Consensus patterns in DNA (context) - Stormo - 1990
17 Line geometries for sequence comparisons (context) - Waterman, Perlwitz - 1984
17 Finding Similar Regions in Many Strings - Li, Ma et al. - 1999
12 On covering problems of codes (context) - Frances, Litman - 1997
10 A linear-time algorithm for the 1-mismatch problem (context) - Berman, Gumucio et al. - 1997
10 Multiple sequence alignment by consensus (context) - Waterman - 1986
9 An improved microcomputer program for finding gene- or gene .. (context) - Lucas, Busch et al. - 1991
7 Finding Similar Regions in Many Sequences - Li, Ma et al.
6 Primer Master: a new program for the design and analysis of .. (context) - Proutski, Holme - 1996
5 Efficient approximation algorithms for the Hamming center pr.. - Gasieniec, Jansson et al. - 1999
5 A polynomial time approximation scheme for the closest subst.. - Ma - 2000
5 Design of primers for PCR amplification of highly variable g.. (context) - Dopazo, Rodr'iguez et al. - 1993
5 Banishing bias from consensus sequences - Ben-Dor, Lancia et al. - 1997
4 Predictive motifs derived from cytosine methyltransferases (context) - Posfai, Bhagwat et al. - 1989
1 COPIA -- a Consensus Pattern Identification and Analysis sof.. (context) - Liang, Li et al. - 2001
1 A chernoff bound for random walks on expanders (context) - Gillman - 1993
1 Also to appear in Information and Computation (context) - Lanctot, Li et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csd.uwo.ca/~bma/): More
Near Optimal Multiple Alignment Within a Band In Polynomial Time - Li, Ma, Wang (2000) (Correct)
A Polynomial Time Approximation Scheme for the Closest Substring.. - Ma (2000) (Correct)
Fitting Distances by Tree Metrics with Increment Error - Ma, Wang, Zhang (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC