English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 13591283      Online Users : 32
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  Systolic Algorithms for the Longest Common Subsequence Problem


    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80847


    Title: Systolic Algorithms for the Longest Common Subsequence Problem
    Authors: Yang, C. B.;Lee, R. C. T.
    教師: 李家同
    Date: 1987
    Publisher: Taylor & Francis
    Relation: Journal of the Chinese Institute of Engineers, Taylor & Francis, Volume 10, Issue 6, 1987, Pages 691-699
    Keywords: systolic algorithm
    parallel processing
    VLSI
    longest common subsequence problem
    Abstract: The concept of systolic array processors is very suitable for VLSI implementation. In this paper, we propose two systolic algorithms to solve the longest common subsequence problem by dynamic programming approach and also prove that these two algorithms are correct. The order of the time‐processor‐product of our algorithms is equal to that of the corresponding sequential method.
    Relation Link: http://www.tandf.co.uk/journals/default.asp
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80847
    Appears in Collections:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML223View/Open


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback