Name
Abstract | ||
|---|---|---|
Measures of sequence similarity and distance based more or less explicitly on subword composition are attracting an increasing interest driven by intensive applications such as massive document classification and genome-wide molecular taxonomy. A uniform character of such measures is in some underlying notion of relative compressibility, whereby two similar sequences are expected to share a larger number of common substrings than two distant ones. This paper reviews some of the approaches to sequence comparison based on subword composition and suggests that their common denominator may ultimately reside in special classes of subwords, the nature of which resonates in interesting ways with the structure of popular subword trees and graphs. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-12476-1_2 | Algorithms and Applications |
Keywords | Field | DocType |
common substrings,similar sequence,popular subword tree,intensive application,common denominator,sequence similarity,sequence comparison,subword composition,maximal word,increasing interest,genome-wide molecular taxonomy | Document classification,Graph,Substring,Kolmogorov complexity,Arithmetic,Theoretical computer science,Fraction (mathematics),Mathematics | Conference |
Volume | ISSN | ISBN |
6060 | 0302-9743 | 3-642-12475-5 |
Citations | PageRank | References |
10 | 0.57 | 18 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alberto Apostolico | 1 | 1441 | 182.20 |