Skip to Content
Toggle navigation
首页
Browse
Browse by Collection
Browse by Project Center
Browse Exhibits
About
About Us
Help
登录
Explore, Discover, Share
转到
Advanced search
搜索条件
清除筛选
筛选:
关键词
String Algorithms
删除限定条件 关键词: String Algorithms
Collections
Major Qualifying Projects
删除限定条件 Collections: Major Qualifying Projects
找到
1
条目
按 relevance 排序
relevance
date uploaded ▼
date uploaded ▲
date modified ▼
date modified ▲
每页显示结果数
10 每页
10
每页
20
每页
50
每页
100
每页
以如下方式察看搜索结果:
列表
图片式展示
砌体式展示
幻灯式展示
Download search results to .CSV file
搜索结果
Add to Category
Remove From Category
Exploring Longest Common Subsequences and the Chvátal-Sankoff Constants
关键词:
String Algorithms
,
Statistics
,
Chvátal-Sankoff Constants
,
Dynamic Programming
, and
Longest Common Subsequence
创造者:
Salls, Andrew
,
Soiffer, Duncan
, and
Miller, Chase
Advisor:
Reichman, Daniel
and
Sarkozy, Gabor N
出版者:
Worcester Polytechnic Institute
创建日期:
2024-04-25
Resource Type:
Major Qualifying Project
Toggle facets
限定搜索
Collections
Major Qualifying Projects
[remove]
1
Year
2024
1
创造者
Miller, Chase
1
Salls, Andrew
1
Soiffer, Duncan
1
Advisor
Reichman, Daniel
1
Sarkozy, Gabor N
1
Major
Computer Science
1
出版者
Worcester Polytechnic Institute
1
资源类型
Major Qualifying Project
1