Sciweavers

139 search results - page 7 / 28
» Finding Gale Strings
Sort
View
CORR
2000
Springer
149views Education» more  CORR 2000»
14 years 9 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
JDA
2008
87views more  JDA 2008»
14 years 9 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
DCC
2005
IEEE
15 years 9 months ago
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...
ACL
2006
14 years 11 months ago
Using String-Kernels for Learning Semantic Parsers
We present a new approach for mapping natural language sentences to their formal meaning representations using stringkernel-based classifiers. Our system learns these classifiers ...
Rohit J. Kate, Raymond J. Mooney
SOFSEM
2010
Springer
15 years 6 months ago
Finding and Certifying Loops
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
Harald Zankl, Christian Sternagel, Dieter Hofbauer...