Sciweavers

7

CPM
2003
Springer

86views Combinatorics» more CPM 2003»

Extracting Approximate Patterns

13 years 10 months ago

Extracting Approximate Patterns

Download www.cs.ucr.edu

Johann Pelfrêne, Saïd Abdeddaïm, J...

claim paper

Read More »

13

CPM
2003
Springer

138views Combinatorics» more CPM 2003»

Complexities of the Centre and Median String Problems

13 years 10 months ago

Complexities of the Centre and Median String Problems

Download www.cs.ucr.edu

François Nicolas, Eric Rivals

claim paper

Read More »

9

CPM
2003
Springer

82views Combinatorics» more CPM 2003»

Sparse LCS Common Substring Alignment

13 years 10 months ago

Sparse LCS Common Substring Alignment

Download www-igm.univ-mlv.fr

Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson

claim paper

Read More »

11

CPM
2003
Springer

95views Combinatorics» more CPM 2003»

A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions

13 years 10 months ago

A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions

Download theorie.informatik.uni-ulm.de

Tzvika Hartman

claim paper

Read More »

8

CPM
2003
Springer

68views Combinatorics» more CPM 2003»

Multiple Genome Alignment: Chaining Algorithms Revisited

13 years 10 months ago

Multiple Genome Alignment: Chaining Algorithms Revisited

Download theorie.informatik.uni-ulm.de

Given n fragments from k > 2 genomes, we will show how to ﬁnd an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...

Mohamed Ibrahim Abouelhoda, Enno Ohlebusch

claim paper

Read More »