Biblioteca Digital

31 resultados para string processing

em Department of Computer Science E-Repository - King's College London, Strand, London

Computing the minimum approximate ? -cover of a string

Relevância:

70.00% 70.00%

Publicador:

On the size of DASG for multiple texts

Relevância:

60.00% 60.00%

Publicador:

A bit-parallel suffix automaton approach for (delta,gamma)-matching in music retrieval

Relevância:

60.00% 60.00%

Publicador:

Longest Motifs with a Functionally Equivalent Block

Relevância:

60.00% 60.00%

Publicador:

Local Transpositions in Alignment of Polyphonic Musical Sequences

Relevância:

60.00% 60.00%

Publicador:

Motif Extraction from Weighted Sequences

Relevância:

60.00% 60.00%

Publicador:

Linear time algorithm for the longest common repeat problem

Relevância:

60.00% 60.00%

Publicador:

Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms

Relevância:

60.00% 60.00%

Publicador:

String Regularities with Don't Cares

Relevância:

20.00% 20.00%

Publicador:

Computing the minimum k-cover of a string

Relevância:

20.00% 20.00%

Publicador:

String regularities with don't cares

Relevância:

20.00% 20.00%

Publicador:

Efficient Experimental String Matching by Weak Factor Recognition

Relevância:

20.00% 20.00%

Publicador:

String pattern matching for a deluge survival kit

Relevância:

20.00% 20.00%

Publicador:

Approximate string matching with gaps

Relevância:

20.00% 20.00%

Publicador:

A unifying look at the Apostolico-Giancarlo string-matching algorithm

Relevância:

20.00% 20.00%

Publicador:

«
1
2
3
»