Method for obtaining longest common substring of alphabetic strings

A technology of the longest common substring and character string, which is applied in the direction of electrical digital data processing, special data processing applications, instruments, etc., can solve the problems of low judgment rate, large space occupation, and practical application difficulties, so as to reduce the workload , improve the efficiency of acquisition, and facilitate the effect of query

Active Publication Date: 2013-02-27
COMP APPL RES INST CHINA ACAD OF ENG PHYSICS
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The above-mentioned method for calculating the longest common substring has a low determination rate, cannot fully meet the needs of practical applications, and takes up a large space, making it difficult for practical applications

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for obtaining longest common substring of alphabetic strings
  • Method for obtaining longest common substring of alphabetic strings
  • Method for obtaining longest common substring of alphabetic strings

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0027] In order to make the above objects, features and advantages of the present invention more concise and understandable, the present invention will be further described below in conjunction with the accompanying drawings and specific embodiments.

[0028] The present invention is applicable to, but not limited to, information security aspects of host logs or network logs. For example, public feature analysis of security logs, log record filtering, and automatic classification of information services. In terms of hardware, it can be used in personal computers, servers, multiprocessor systems, and computing environments including any of the above systems, etc.

[0029] The invention may be described by computer program modules, which generally include programs, objects, components, data structures, and the like. Program modules may reside in local computer storage media.

[0030] The S described in the present invention 1 and S 2 Represents the source character string, ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a method for obtaining the longest common substring among alphabetic strings. For improving the efficiency to obtain the longest common substring among alphabetic strings, the method comprises the following steps that: firstly, bidirectional comparison is carried out between the two sides of a match byte so as to obtain initial common substrings and calculate the lengths of the initial common substrings; and secondly, based on the existing longest common substring, a longer common substring is repeatedly tried to be found by means of combing multiple trans-mechanisms.until all alphabetic strings are subjected to the process. The invention has the advantages of improving the calculation efficiency for obtaining the longest common substring and reducing resource overhead.

Description

technical field [0001] The invention belongs to the technical field of character discrimination, and in particular relates to a method for obtaining the longest common substring of a character string. Background technique [0002] With the continuous development of society, the amount of information in all aspects is increasing, and it is becoming more and more difficult to find or exclude some given information from it. By finding the longest common substring (Longest Common Substring) is one way to solve the above problem. The longest common substring can be used to measure the similarity between character strings, and is often used in biological sequence analysis, piracy detection, information security, etc. The current methods for obtaining the longest common substring mainly include methods based on Dynamic Programming, methods based on Generalized Suffix Tree and methods based on Suffix Array. [0003] The method based on dynamic programming is very simple, and it is...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06F17/30
Inventor 王开云孔思淇付云生
Owner COMP APPL RES INST CHINA ACAD OF ENG PHYSICS
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap