Multi-sorting algorithm for finding pairs of similar short substrings from large-scale string data

ISSN： 0219-1377

Source： Knowledge and Information Systems, Vol.25, Iss.2, 2010-11, pp. : 229-251

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Identifying long tail term from large‐scale candidate pairs for big data‐oriented patent analysis

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 28, Iss. 15, 2016-10 ,pp. : 4194-4208

John Wiley & Sons Inc

Access to resources Recommend Favorite

RSEDP: an effective hybrid data placement algorithm for large-scale storage systems

By Xiao Nong Chen Tao Liu Fang

The Journal of Supercomputing, Vol. 55, Iss. 1, 2011-01 ,pp. : 103-122

Springer Publishing Company

Access to resources Recommend Favorite

On the complexity of finding common approximate substrings

By Evans P.A. Smith A.D. Wareham H.T.

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 407-430

Elsevier

Access to resources Recommend Favorite

A Large-Scale Multi-Lingual Color Thesaurus

By Lindner Albrecht Li Bryan Zhi Bonnier Nicolas Süsstrunk Sabine

Color and Imaging Conference, Vol. 2012, Iss. 1, 2012-01 ,pp. : 30-35

Society for Imaging Science and Technology

Access to resources Recommend Favorite

Computational and data Grids in large-scale science and engineering

By Johnston W.E.

Future Generation Computer Systems, Vol. 18, Iss. 8, 2002-10 ,pp. : 1085-1100

Elsevier

Access to resources Recommend Favorite