VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING (Q3021938): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60704269, #quickstatements; #temporary_batch_1714786519576 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A fast bit-vector algorithm for approximate string matching based on dynamic programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The theory and computation of evolutionary distances: Pattern recognition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for approximate string matching / rank | |||
Normal rank | |||
Revision as of 11:45, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING |
scientific article |
Statements
VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING (English)
0 references
22 June 2005
0 references
vector algorithms
0 references
computational biology
0 references
string matching
0 references
