Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences

No abstract is available for this paper.

• Publication year

  2012

• Venue

  SPIRE

• Publication date

  2012-10-21

• Fields of study

  Biology, Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-34109-0_11
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient Maximal Repeat Finding Using the Burrows-Wheeler Transform and Wavelet Tree

  2012cited by this paper
• Computing the longest common prefix array based on the Burrows-Wheeler transform

  2011cited by this paper
• Top-k Ranked Document Search in General Text Databases

  2010cited by this paper
• Lightweight LCP-Array Construction in Linear Time

  2010cited by this paper
• Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I

  2010cited by this paper
• Fast, Practical Algorithms for Computing All the Repeats in a String

  2010cited by this paper
• Extracting Powers and Periods in a String from Its Runs Structure

  2010cited by this paper
• Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome

  2009cited by this paper
• A Linear-Time Burrows-Wheeler Transform Using Induced Sorting

  2009cited by this paper
• Finding Repeats in Genome Sequences

  2008cited by this paper
• On-line construction of compact suffix vectors and maximal repeats

  2008cited by this paper
• A survey on peer-to-peer key management for mobile ad hoc networks

  2007cited by this paper
• A taxonomy of suffix array construction algorithms

  2007cited by this paper
• Replacing suffix trees with enhanced suffix arrays

  2004cited by this paper
• High-order entropy-compressed text indexes

  2003cited by this paper
• Computing all Repeats Using Suffix Arrays

  2003cited by this paper
• On maximal repeats in strings

  2001cited by this paper
• Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

  2001cited by this paper
• Opportunistic data structures with applications

  2000cited by this paper
• Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology

  1997cited by this paper
• A Block-sorting Lossless Data Compression Algorithm

  1994cited by this paper

• R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies

  2025cites this paper
• Hardness Results on Characteristics for Elastic-Degenerated Strings

  2024cites this paper
• Constructing the CDAWG CFG using LCP-Intervals

  2023cites this paper
• Finding repeated strings in code repositories and its applications to code-clone detection

  2021influential citation
• R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space

  2021influential citation
• Enumeration of LCP values, LCP intervals and Maximal repeats in BWT-runs Bounded Space

  2020cites this paper
• Edge Minimization in de Bruijn Graphs

  2019cites this paper
• An Efficient Tool for Searching Maximal and Super Maximal Repeats in Large DNA/Protein Sequences via Induced-Enhanced Suffix Array

  2019cites this paper
• On stabbing queries for generalised longest repeats

  2016cites this paper
• Linear-time String Indexing and Analysis in Small Space

  2016influential citation
• Suffix Trees and Arrays

  2016cites this paper
• On Longest Repeat Queries

  2015cites this paper
• On stabbing queries for generalized longest repeat

  2015cites this paper
• On Longest Repeat Queries Using GPU

  2015cites this paper
• Alphabet-independent algorithms for finding context-sensitive repeats in linear time

  2014cites this paper
• Linear time construction of compressed text indices in compact space

  2014cites this paper
• RACE: A Scalable and Elastic Parallel System for Discovering Repeats in Very Long Sequences

  2013cites this paper
• Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform

  2013cites this paper