Biblioteca Digital

18 resultados para Common graves

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

Efficient algorithms for finding a longest common increasing subsequence

Relevância:

20.00% 20.00%

Publicador:

Efficient Algorithms for Finding a Longest Common Increasing Subsequence

Relevância:

20.00% 20.00%

Publicador:

Verification and Prediction of Timed Probabilistic Properties over the Distributed Management Taskforce Common Information Model

Relevância:

20.00% 20.00%

Publicador:

Verification and Prediction of Timed Probabilistic Properties over the Distributed Management Taskforce Common Information Model

Relevância:

20.00% 20.00%

Publicador:

A fast and practical bit-vector algorithms for the longest common subsequence problem

Relevância:

20.00% 20.00%

Publicador:

Application of suffix trees for the acquisition of common motifs with gaps in a set of strings

Relevância:

20.00% 20.00%

Publicador:

Linear time algorithm for the longest common repeat problem

Relevância:

20.00% 20.00%

Publicador:

A First Approach to Finding Common Motifs with Gaps

Relevância:

20.00% 20.00%

Publicador:

A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence Problem

Relevância:

20.00% 20.00%

Publicador:

Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata

Relevância:

20.00% 20.00%

Publicador:

The Constrained Longest Common Subsequence Problem for Degenerate Strings

Relevância:

20.00% 20.00%

Publicador:

Algorithms for Computing the Longest Parameterized Common Subsequence

Relevância:

20.00% 20.00%

Publicador:

A New Efficient Algorithm for computing the Longest Common Subsequence

Relevância:

20.00% 20.00%

Publicador:

Algorithms for Computing Variants of the Longest Common Subsequence Problem

Relevância:

20.00% 20.00%

Publicador:

Finding Common Motifs with Gaps using Finite Automata

Relevância:

20.00% 20.00%

Publicador:

«
1
2
»