Efficient top-k string similarity query algorithms

您当前的位置：

首页 >

文章列表页 >

Efficient top-k string similarity query algorithms

Paper | 更新时间：2024-06-05

- Efficient top-k string similarity query algorithms
- Communication Journal Vol. 35, Issue 12, Pages: 10-20(2014)
- 作者机构：
  
  1. 燕山大学信息科学与工程学院，河北秦皇岛 066004
  2. 河北省计算机虚拟技术与系统集成重点实验室，河北秦皇岛 066004
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61040023);The National Natural Science Foundation of China(61272124);The National Natural Science Foundation of China(61303040);The Research Funds From Education Department of Hebei Province(Y2012014);The Science and Technology Research and Development Program of Hebei Province(11213578)
- DOI：10.3969/j.issn.1000-436x.2014.12.002
  CLC： TP311
- Online First：2014-12，
  
  Published：25 December 2014
- 稿件说明：
移动端阅览
Zi-yang CHEN, Yu-jun HAN, Xuan WANG, et al. Efficient top-k string similarity query algorithms[J]. Communication Journal, 2014, 35(12): 10-20.
DOI：

Zi-yang CHEN, Yu-jun HAN, Xuan WANG, et al. Efficient top-k string similarity query algorithms[J]. Communication Journal, 2014, 35(12): 10-20. DOI： 10.3969/j.issn.1000-436x.2014.12.002.

0

Views

294

下载量

0

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Related Articles

No data

Related Author

No data

Related Institution

No data

AI导读

AI问答

⁰