51 search results - page 10 / 11 » Approximate String Matching in LDAP Based on Edit Distance |
BTW
2005
Springer
13 years 12 months ago
2005
Springer
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
FSTTCS
2003
Springer
13 years 11 months ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
SEMWEB
2007
Springer
14 years 16 days ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
BMCBI
2010
13 years 3 months ago
2010
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
SSDBM
2010
IEEE
13 years 10 months ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....