A linear-time algorithm for computing characteristic strings

  • Michio Nakanishi
  • Morio Hasidume
  • Minoru Ito
  • Akihiro Hashimoto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 834)


Let S be a finite set of strings and let T be a subset of S. A characteristic string of T under S is a string that is a common substring of T and that is not a substring of any string in S-T. We present a lineartime algorithm for deciding whether or not there exists a characteristic string of T under S. If such a string exists, then the algorithm returns all the shortest characteristic strings of T under S in that time.


characteristic string approximate string matching suffix tree DNA probe 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Hasidume, M. Ito, M. Nakanishi and A. Hashimoto: “A linear-time algorithm for computing a shortest characteristic substring of strings” (in Japanese), IEICE Technical Report, COMP93-36, pp.39–46 (July 1993).Google Scholar
  2. 2.
    D.G. Higgins and P.M. Sharp: “Fast and sensitive multiple sequence alignments on a microcomputer”, CABIOS, 5, 2, pp.151–153 (Apr. 1989).PubMedGoogle Scholar
  3. 3.
    M.Ito, K. Shimizu, M. Nakanishi and A. Hashimoto: “Polynomial-time algorithms for computing characteristic strings,” Proc. of 5th Symposium on Combinatorial Pattern Matching, To apprear (June 1994).Google Scholar
  4. 4.
    G.M. Landau and U.Vishkin: “Introducing efficient parallelism into approximate string matching and a new serial algorithm,” Proc. 18th ACM Symp. on Theory of Computing, pp.220–230 (May 1986).Google Scholar
  5. 5.
    V.I. Levenshtein: “Binary codes capable of correcting deletions, insertions, and reversals”, Cybernetics and Control Theory, 10, 8, pp.707–710(1966)Google Scholar
  6. 6.
    A.J.L. Macario and E.C. de Macario: “Gene Probes for Bacteria,” Academic Press (1990)Google Scholar
  7. 7.
    E.M. McCreight: “A space-economical suffix tree construction algorithm”, Journal of ACM, 23, 2, pp.262–272 (Apr. 1976).Google Scholar
  8. 8.
    M. Nasu, K. Shimada, S. Inaoka, K. Tani and M. Kondo: “ Natural bacterial populations in river water determined by 16S and 23S rRNA-targeted oligonucleotide probes,” (submitted to Biomedical and Environmental Sciences).Google Scholar
  9. 9.
    W.R. Pearson and D.J. Lipman: “Improved tools for biological sequence comparison”, Proc. Natl. Acad. Sci. USA, 85, pp.2444–2448 (Apr. 1988).PubMedGoogle Scholar
  10. 10.
    P. Weiner: “Linear pattern matching algorithms,” Proc. IEEE 14th Symposium on Switching and Automata Theory, pp.1–11 (1973)Google Scholar
  11. 11.
    “Genome Databases,” Science, 254 (Oct. 1991).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Michio Nakanishi
    • 1
  • Morio Hasidume
    • 1
  • Minoru Ito
    • 2
  • Akihiro Hashimoto
    • 1
  1. 1.Department of Information and Computer Sciences, Faculty of Engineering ScienceOsaka UniversityOsakaJapan
  2. 2.Graduate School of Information ScienceNara Institute of Science and TechnologyNaraJapan

Personalised recommendations