J. Kevin Lanctot, Ming Li, En-hui Yang  Home/Search
Context Related
| monod.uwaterloo.ca/paper...00entropy.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: monod.uwaterloo.ca/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents the first entropy estimator for DNA sequences that has both proven properties and excellent entropy estimates. Additionally our algorithm, the Grammar Transform Analysis and Compression (GTAC) entropy estimator, uses a novel data structure to repeatedly solve the longest non-overlapping pattern problem in linear time. GTAC beats all known competitors in running time, in the low values of its entropy estimates, and in the properties that have been proven about it. 1... (Update)
Similar documents based on text: More All
0.0: Protein Threading by Linear Programming - Xu, Li, Lin, Al. (2003) (Correct)
0.0: Identification via Compressed Data - Ahlswede, Yang, Zhang (1998) (Correct)
0.0: Quantum beats revisited: A quantum jump approach - Hegerfeldt, Plenio (Correct)
Related documents from co-citation: More All
3: Entrez Nucleotide Query (context) - for, Information
3: A New Challenge for Compression Algorithms: Genetic Sequences - Grumbach, Tahi - 1994
2: Protein is incompressible (context) - Nevill-Manning, Witten - 1999
BibTeX entry: (Update)
K. Lanctot, M. Li, E.H. Yang. Estimating DNA sequence entropy, to appear in SODA'2000. http://citeseer.ist.psu.edu/lanctot00estimating.html More
@inproceedings{ lanctot00estimating,
author = "J. Kevin Lanctot and Ming Li and En-Hui Yang",
title = "Estimating {DNA} sequence entropy",
booktitle = "Symposium on Discrete Algorithms",
pages = "409-418",
year = "2000",
url = "citeseer.ist.psu.edu/lanctot00estimating.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
99 Cambridge University Press (context) - Gusfield, Strings et al. - 1997
76 Line Construction of Suffix Trees - Ukkonen - 1995
39 Oxford University Press (context) - Lewin, VI - 1997
26 A New Challenge for Compression Algorithms: Genetic Sequence.. - Grumbach, Tahi - 1994
16 the entropy of DNA: Algorithms and measurements based on mem.. - Farach, Noordewier et al. - 1994
8 Grammar Based Codes: A New Class of Universal Lossless Sourc.. - Kieffer, Yang
8 Significantly Lower Entropy Estimates for Natural DNA Sequen.. - Loewenstern, Yianilos
7 Compression of DNA sequences (context) - Grumbach, Tahi - 1993
4 Entrez Nucleotide Query (context) - for, Information
2 Ergodic Behavior of Graph Entropy - Kieffer, Yang - 1997
1 Estimating the Entropy of DNA Sequences (context) - Schmitt, Herzel - 1997
1 Efficient universal lossless compression algorithms based on.. (context) - Yang, Kieffer
1 High Statistics Block Entropy Measures of DNA Sequences (context) - Lio, Politi et al. - 1996
1 IEEE Information Theory and Communications Workshop (context) - Yang, Kieffer et al. - 1999
1 CDNA source code (context) - Yianilos
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://monod.uwaterloo.ca/papers/): More
An Approximation Algorithm for Character Compatibility and Fast.. - Tsang (2000) (Correct)
Drug Discovery in the Bioinformatics Age - Duggan, Fejes, Ingram, Salazar.. (2000) (Correct)
A Practical Algorithm for Recovering the Best.. - Berry, Jiang.. (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC