Sciweavers

302 search results - page 11 / 61
» Semi-local string comparison: algorithmic techniques and app...
Sort
View
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
15 years 3 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
JCDL
2004
ACM
94views Education» more  JCDL 2004»
15 years 3 months ago
Element matching in concept maps
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
Byron Marshall, Therani Madhusudan
BMCBI
2008
122views more  BMCBI 2008»
14 years 10 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
JCB
2007
94views more  JCB 2007»
14 years 9 months ago
Locality and Gaps in RNA Comparison
Locality is an important and well-studied notion in comparative analysis of biological sequences. Similarly, taking into account affine gap penalties when calculating biological ...
Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M...
ISSTA
2009
ACM
15 years 4 months ago
HAMPI: a solver for string constraints
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. Th...
Adam Kiezun, Vijay Ganesh, Philip J. Guo, Pieter H...