Sciweavers

1028 search results - page 19 / 206
» Character sets of strings
Sort
View
DLT
2008
13 years 9 months ago
Universal Recursively Enumerable Sets of Strings
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the...
Cristian S. Calude, André Nies, Ludwig Stai...
BMCBI
2010
86views more  BMCBI 2010»
13 years 7 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
BIBE
2007
IEEE
174views Bioinformatics» more  BIBE 2007»
14 years 1 months ago
Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
CPM
1995
Springer
93views Combinatorics» more  CPM 1995»
13 years 11 months ago
Matching a Set of Strings with Variable Length Don't Cares
Gregory Kucherov, Michaël Rusinowitch