Biblioteca Digital

30 resultados para Weakly Increasing Sequences

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:

Constructing Multiple Unique Input/Output Sequences Using Evolutionary Optimisation Techniques

Relevância:

20.00% 20.00%

Publicador:

Evolving Transformation Sequences using Genetic Algorithms

Relevância:

20.00% 20.00%

Publicador:

Computing Unique Input/Output Sequences Using Genetic Algorithms

Relevância:

20.00% 20.00%

Publicador:

Computing Evolutionary Chains in Musical Sequences

Relevância:

20.00% 20.00%

Publicador:

Algorithms for computing approximate repetitions in musical sequences

Relevância:

20.00% 20.00%

Publicador:

Motifs in Sequences: Localization and Extraction

Relevância:

20.00% 20.00%

Publicador:

All Maximal Pairs in Step-Leap Representation of Melodic Sequences

Relevância:

20.00% 20.00%

Publicador:

Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences

Relevância:

20.00% 20.00%

Publicador:

Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences

Relevância:

20.00% 20.00%

Publicador:

Computing the regularities in biological weighted sequences

Relevância:

20.00% 20.00%

Publicador:

The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications

Relevância:

20.00% 20.00%

Publicador:

Computation of Repetitions and Regularities of Biologically Weighted Sequences

Relevância:

20.00% 20.00%

Publicador:

Efficient Algorithms for Handling Molecular Weighted Sequences

Relevância:

20.00% 20.00%

Publicador:

«
1
2
»