901 search results - page 52 / 181 » On Anonymization of String Data |
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
We describe a Markov chain Bayesian classification tool, SCS, that can perform data-driven classification of proteins and protein segments. Training data for interesting classific...
100
click to vote
PR
1998
14 years 11 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
SODA
1997
ACM
15 years 1 months ago
1997
ACM
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
CICLING
2009
Springer
15 years 28 days ago
2009
Springer
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
FCT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The simple intramolecular model for gene assembly in ciliates is particularly interesting because it can predict the correct assembly of all available experimental data, ...