Method and equipment for determining common subsequence of text strings
US10769192B2 · kind B2 · utility
0Cited by
1References
9Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Sep 21, 2016 |
| Grant date | Sep 8, 2020 |
| Priority date | — |
| Expiry date | Jun 4, 2037 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F40/279
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for determining a longest common subsequence in a plurality of text strings. The method comprises: separately converting a plurality of text strings into word sequences (S100); classifying the word sequences (S400); and performing longest common subsequence computation on every class (S500). The time needed by LCS computation can be saved by classifying text strings.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.