Sciweavers

516 search results - page 14 / 104
» Sets of k-Independent Strings
Sort
View
TVCG
2008
111views more  TVCG 2008»
13 years 7 months ago
Interactive Visual Analysis of Set-Typed Data
While it is quite typical to deal with attributes of different data types in the visualization of heterogeneous, multivariate datasets, most existing techniques still focus on the ...
Wolfgang Freiler, Kresimir Matkovic, Helwig Hauser
SOFSEM
2010
Springer
14 years 4 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
RECOMB
2002
Springer
14 years 7 months ago
String barcoding: uncovering optimal virus signatures
There are many critical situations when one needs to rapidly identify an unidentified pathogen from among a given set of previously sequenced pathogens. DNA or RNA hybridization c...
Sam Rash, Dan Gusfield
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 7 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
DIS
2006
Springer
13 years 11 months ago
A New Family of String Classifiers Based on Local Relatedness
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masay...