Sciweavers

9 search results - page 1 / 2
» Swiftly Computing Center Strings
Sort
View
WABI
2010
Springer
143views Bioinformatics» more  WABI 2010»
13 years 3 months ago
Swiftly Computing Center Strings
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
Franziska Hufsky, Léon Kuchenbecker, Kathar...
CLEANDB
2006
ACM
145views Database» more  CLEANDB 2006»
13 years 10 months ago
Cleansing Databases of Misspelled Proper Nouns
The paper presents a data cleansing technique for string databases. We propose and evaluate an algorithm that identifies a group of strings that consists of (multiple) occurrence...
Arturas Mazeika, Michael H. Böhlen
ICDCS
2006
IEEE
13 years 10 months ago
Distributed Computing for Efficient Hyperspectral Imaging Using Fully Heterogeneous Networks of Workstations
Hyperspectral imaging is a new technique which has become increasingly important in many remote sensing applications, including automatic target recognition for military and defen...
Antonio Plaza, Javier Plaza, David Valencia
CORR
2000
Springer
149views Education» more  CORR 2000»
13 years 4 months ago
On The Closest String and Substring Problems
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
Ming Li, Bin Ma, Lusheng Wang
DCC
2002
IEEE
14 years 4 months ago
Optimized Edgebreaker Encoding for Large and Regular Triangle Meshes
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness o...
Andrzej Szymczak