Title page for etd-0724100-122252


[Back to Results | New Search]

URN etd-0724100-122252
Author Jenn-Dar Chang
Author's Email Address changjd@math.nsysu.edu.tw
Statistics This thesis had been viewed 5103 times. Download 1754 times.
Department Applied Mathematics
Year 1999
Semester 2
Degree Master
Type of Document
Language English
Title String Superprimitivity test and LCS on the Reconfigurable Bus Model
Date of Defense 2000-07-14
Page Count 54
Keyword
  • superprimitivity
  • LCS
  • border
  • cover
  • reconfigurable bus model
  • Abstract Problems of some regularities in strings, such as repetition,
    period, seed, square, etc., have been studied extensively
    recently. Many algorithms have been proposed to solve these
    problems in O(1) time complexity on an n imes n
    reconfigurable bus model, where $n$ is the length of the given
    string.
    In this paper, we concentrate to solve problems of another form of
    regularity, the string superprimitivity test problem and the
    LCS (longest common subsequence) problem in strings on the
    reconfigurable bus model. And we propose a O(log n) time
    parallel algorithm to solve the string superprimitivity test
    problem. We also review some algorithms for the LCS problem.
    Further research is also given in this paper.
    Advisory Committee
  • Yue-Li Wang - chair
  • S.C. Tai - co-chair
  • Chang-Biau Yang - advisor
  • Files
  • superprimitivity2.pdf
  • indicate access worldwide
    Date of Submission 2000-07-24

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys