Sciweavers

161 search results - page 1 / 33
» Counting Distinct Strings
Sort
View
ALGORITHMICA
1999
75views more  ALGORITHMICA 1999»
13 years 5 months ago
Counting Distinct Strings
Dennis Moore, William F. Smyth, D. Miller
JQL
2006
75views more  JQL 2006»
13 years 5 months ago
Improving calculations of the number of distinct alignments of two strings
In a recent work, M. Covington discusses the enumeration of two different sets of alignments of two strings of symbols using elementary combinatorial techniques. He defines two fu...
Øystein J. Rødseth, James A. Sellers
TCS
2008
13 years 5 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
13 years 11 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala
IJCNLP
2005
Springer
13 years 10 months ago
Detecting Article Errors Based on the Mass Count Distinction
Abstract. This paper proposes a method for detecting errors concerning article usage and singular/plural usage based on the mass count distinction. Although the mass count distinct...
Ryo Nagata, Takahiro Wakana, Fumito Masui, Atsuo K...