Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences

No abstract is available for this paper.

• Publication year

  1997

• Venue

  Comput. Appl. Biosci.

• Publication date

  1997-04-01

• Fields of study

  Biology, Medicine, Computer Science

• Identifiers
  DOI 10.1093/bioinformatics/13.2.131PMID 9146959
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar, PubMed

• No claims are published for this paper.

• No concepts are published for this paper.

• Algorithmes de compression et applications à l'analyse de séquences génétiques

  1996cited by this paper
• DosDNA occurs along yeast chromosomes, regardless of functional significance of the sequence.

  1995cited by this paper
• A first step toward chromosome analysis by compression algorithms

  1995cited by this paper
• Over-representation of the disease associated (CAG) and (CGG) repeats in the human genome.

  1994cited by this paper
• A New Challenge for Compression Algorithms: Genetic Sequences

  1994cited by this paper
• A method for fast database search for all k-nucleotide repeats.

  1994influential reference
• Information, complexité et hasard

  1994cited by this paper
• An Introduction to Kolmogorov Complexity and Its Applications

  1993cited by this paper
• Discovering simple DNA sequences by the algorithmic significance method

  1993cited by this paper
• Assessments of DNA inhomogeneities in yeast chromosome III.

  1993cited by this paper
• Identifying Periodic Occurrences of a Template with Applications to Protein Structure

  1993cited by this paper
• Identifying Periodic Occurrences of a Template with Applications to Protein Structures

  1992cited by this paper
• Information Theory

  1987cited by this paper
• Compression of individual sequences via variable-rate coding

  1978cited by this paper

• Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares

  2025cites this paper
• AlcoR: alignment-free simulation, mapping, and visualization of low-complexity regions in biological data

  2022cites this paper
• Expected Algorithmic Specified Complexity

  2019cites this paper
• A DNA Sequence Corpus for Compression Benchmark

  2018cites this paper
• Input–output maps are strongly biased towards simple outputs

  2018cites this paper
• DNA sequence compression within traditional text compression algorithms

  2017cites this paper
• C# desktop application with connection to the European Nucleotide Archive for fast identification of tandem repeats

  2017cites this paper
• FB2 Compression & Selective Encryption on DNA Sequence

  2016cites this paper
• MetaPalette: a k-mer Painting Approach for Metagenomic Taxonomic Profiling and Quantification of Novel Strain Variation

  2016cites this paper
• Compressing Genome Resequencing Data

  2016cites this paper
• Information Profiles for DNA Pattern Discovery

  2014cites this paper
• On Entropy-Based Data Mining

  2014cites this paper
• A Compression & Encryption Algorithm on DNA Sequences Using Dynamic Look up Table and Modified Huffman Techniques

  2013cites this paper
• DNA Sequences at a Glance

  2013cites this paper
• Textual data compression in computational biology: Algorithmic techniques

  2012cites this paper
• Searching for Compact Hierarchical Structures in DNA by means of the Smallest Grammar Problem

  2011cites this paper
• Online Genome Compression Software

  2011cites this paper
• Notice of RetractionWebpage Development for Genome Compression Technique

  2010cites this paper
• TRStalker: an efficient heuristic for finding fuzzy tandem repeats

  2010cites this paper
• An automatic procedure to search highly repetitive sequences in genome as fluorescence in situ hybridization probes and its application on Brachypodium distachyon

  2010cites this paper
• Generalized substring compression

  2009cites this paper
• IMPROVING REMOTE HOMOLOGY DETECTION USING A SEQUENCE PROPERTY APPROACH

  2009cites this paper
• TRStalker: an Efficient Heuristic for Finding NP-Complete Tandem Repeats

  2009cites this paper
• Textual data compression in computational biology: a synopsis

  2009cites this paper
• Direct Suffix Sorting and Its Applications

  2008cites this paper
• An integrated software tool for detecting criminals using DNA databases

  2008cites this paper
• GenomeCompress : A Novel Algorithm for DNA Compression

  2007cites this paper
• United States Patent Application Publication: SYSTEM AND METHOD FOR SEQUENCE DISTANCE MEASURE FOR PHYLOGENETIC TREE CONSTRUCTION

  2007cites this paper
• Physical Characterization of Genomes Through BAC End Sequencing

  2007cites this paper
• FireμSat: meeting the challenge of detecting microsatellites in DNA

  2006cites this paper
• FireµSat: An algorithm to detect microsatellites in DNA

  2006cites this paper
• On compressibility of protein sequences

  2006cites this paper
• Substring compression problems

  2005cites this paper
• Detection and analysis of megasatellites in the human genome using in silico methods

  2005cites this paper
• Client Side Decompression Technique Provides Faster DNA Sequence Data Delivery

  2005cites this paper
• STAR: an algorithm to Search for Tandem Approximate Repeats

  2004cites this paper
• Modelling-Alignment for Non-random Sequences

  2004cites this paper
• A Survey On Algorithmic Aspects Of Tandem Repeats Evolution

  2004cites this paper
• An exhaustive DNA micro-satellite map of the human genome using high performance computing.

  2003cites this paper
• mreps: efficient and flexible detection of tandem repeats in DNA

  2003cites this paper
• An appraisal of the potential for illegitimate recombination in bacterial genomes and its consequences: from duplications to genome reduction.

  2003cites this paper
• STRING: finding tandem repeats in DNA sequences

  2003cites this paper
• Structural and Semantic Information Extraction

  2003cites this paper
• A Compression Algorithm as a Complexity Measure on DNA Sequences

  2003cites this paper
• Computable Information Content and a Simple Application to the Study of DNA

  2003cites this paper
• Pattern discovery in biology and strings sorting: theory and experimentation / Ezekiel Adebiyi

  2002cites this paper
• Entropy and complexity of finite sequences as fluctuating quantities.

  2002cites this paper
• Indexing and Retrieval for Genomic Databases

  2002cites this paper
• Sciences: molecular biology

  2002cites this paper
• DNA sequence compression using the Burrows-Wheeler Transform

  2002cites this paper
• Algorithms for Sequence Alignment

  2001cites this paper
• Algorithmic support for PCR and genome-wide repeat analysis

  2001cites this paper
• A compression algorithm for DNA sequences

  2001cites this paper
• FAULT-TOLERANT REPEAT PATTERN MINING ON BIOLOGICAL DATA

  2001cites this paper
• Information content of protein sequences.

  2000cites this paper
• Implication of gene distribution in the bacterial chromosome for the bacterial cell factory.

  2000cites this paper
• Computation and Visualization of Degenerate Repeats in Complete Genomes

  2000cites this paper
• Mapping the bacterial cell architecture into the chromosome.

  2000cites this paper
• Detecting Localized Repeats in Genomic Sequences: A New Strategy and Its Application to Bacillus Subtilis and Arabidopsis Thaliana Sequences

  2000cites this paper
• Compression of biological sequences by greedy off-line textual substitution

  2000cites this paper
• Off-line compression by greedy textual substitution

  2000cites this paper
• A compression algorithm for DNA sequences and its applications in genome comparison

  2000cites this paper
• Tandem repeats finder: a program to analyze DNA sequences.

  1999cites this paper
• Primer design for large scale sequencing.

  1998cites this paper
• The transformation distance: A dissimilarity measure based an movements of segments

  1998cites this paper
• Identifying Satellites and Periodic Repetitions in Biological Sequences

  1998cites this paper
• A comparative study of sequence analysis tools in computational biology

  1998cites this paper
• Some theory and practice of greedy off-line textual substitution

  1998cites this paper
• Identifying satellites in nucleic acid sequences

  1998influential citation
• An algorithm for finding tandem repeats of unspecified pattern size

  1998cites this paper
• Optimal Representation in Average Using Kolmogorov Complexity

  1998cites this paper
• RAPPORT DE RECHERCHE A Survey on Algorithmic Aspects of Tandem Repeats Evolution

  year unknowncites this paper