Sciweavers

365 search results - page 59 / 73
» On the combinatorics of Galois numbers
Sort
View
COCOON
2010
Springer
15 years 4 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
15 years 3 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 1 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
ENDM
2002
86views more  ENDM 2002»
14 years 11 months ago
Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree
Let k be an integer and M be a closed 2-manifold with Euler characteristic (M) 0. We prove that each polyhedral map G on M with minimum degree and large number of vertices conta...
Stanislav Jendrol, Heinz-Jürgen Voss
89
Voted
COCOON
2007
Springer
15 years 6 months ago
Colored Simultaneous Geometric Embeddings
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabr...