Sciweavers

13 search results - page 3 / 3
» Reconciling Data Compression and Kolmogorov Complexity
Sort
View
LATA
2010
Springer
14 years 5 days ago
Choosing Word Occurrences for the Smallest Grammar Problem
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
Rafael Carrascosa, François Coste, Matthias...
BMCBI
2007
128views more  BMCBI 2007»
13 years 5 months ago
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assess
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
Paolo Ferragina, Raffaele Giancarlo, Valentina Gre...
ICDM
2009
IEEE
105views Data Mining» more  ICDM 2009»
14 years 6 hour ago
Multi-document Summarization by Information Distance
—We are now living in a world where information is growing and updating quickly. Knowledge can be acquired more efficiently with the help of automatic document summarization and...
Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li