Compressed Directed Acyclic Word Graph with Application in Local Alignment

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Algorithmica

• Publication date

  2013-05-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00453-013-9794-z
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Ultra-succinct representation of ordered trees with applications

  2012influential reference
• Fast and accurate long-read alignment with Burrows–Wheeler transform

  2010cited by this paper
• Ultrafast and memory-efficient alignment of short DNA sequences to the human genome

  2009cited by this paper
• Compressed indexing and local alignment of DNA

  2008influential reference
• Indexed Approximate String Matching

  2008cited by this paper
• Suffix Tree Based Approach for Chinese Information Retrieval

  2008cited by this paper
• A new suffix tree similarity measure for document clustering

  2007cited by this paper
• CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences

  2007cited by this paper
• Implicit Compression Boosting with Applications to Self-indexing

  2007influential reference
• A Hybrid Indexing Method for Approximate String Matching

  2007cited by this paper
• Compressed Suffix Trees with Full Functionality

  2007cited by this paper
• Rank/select operations on large alphabets: a tool for text indexing

  2006cited by this paper
• Sparse compact directed acyclic word graphs

  2006cited by this paper
• Suffix Tree Based Data Compression

  2005cited by this paper
• Average-Case Analysis of Approximate Trie Search

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

  2003cited by this paper
• Indexing Compressed Text

  2003influential reference
• OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences

  2003cited by this paper
• REPuter: the manifold applications of repeat analysis on a genomic scale.

  2001cited by this paper
• A guided tour to approximate string matching

  2001cited by this paper
• A fast algorithm on average for all-against-all sequence matching

  1999cited by this paper
• On Compact Directed Acyclic Word Graphs

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

  1997cited by this paper
• Extended application of suffix trees to data compression

  1996cited by this paper
• Suffix arrays: a new method for on-line string searches

  1993cited by this paper
• Basic local alignment search tool.

  1990influential reference
• The world's fastest Scrabble program

  1988cited by this paper
• The Smallest Automaton Recognizing the Subwords of a Text

  1985influential reference
• Identification of common molecular subsequences.

  1981cited by this paper
• Linear Pattern Matching Algorithms

  1973cited by this paper

• Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings

  2020cites this paper
• Implementing a Simulated Directed Acyclic Word Graph for Computing Local Alignment

  2014cites this paper