Color Set Size problem with applications to string matching

  • Lucas Chi
  • Kwong Hui
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 644)

Abstract

The Color Set Size problem is: Given a rooted tree of size n with l leaves colored from 1 to m, ml, for each vertex u find the number of different leaf colors in the subtree rooted at u. This problem formulation, together with the Generalized Suffix Tree data structure has applications to string matching. This paper gives an optimal sequential solution of the color set size problem and string matching applications including a linear time algorithm for the problem of finding the longest substring common to at least k out of m input strings for all k between 1 and m. In addition, parallel solutions to the above problems are given. These solutions may shed light on problems in computational biology, such as the multiple string alignment problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1992

Authors and Affiliations

  • Lucas Chi
    • 1
  • Kwong Hui
    • 1
  1. 1.Computer ScienceUniversity of California, DavisDavis

Personalised recommendations