首页 | 本学科首页   官方微博 | 高级检索  
     


Generalized LCS
Authors:Amihood Amir  Tzvika Hartman  Oren Kapah  B. Riva Shalom  Dekel Tsur
Affiliation:1. Department of Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel;2. Department of Computer Science, Johns Hopkins University, Baltimore, MD 21218, United States;3. The Caesaria Rothschild Foundation, Institute for Interdisciplinary Applications of Computer Science, Haifa University, Mount Carmel, Haifa 31905, Israel;4. Department of Computer Science, Ben-Gurion University, Be’er Sheva 84105, Israel
Abstract:
Keywords:Longest common subsequence   Matrices   Trees   Non crossing matching
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号