Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Compressed spaced suffix arrays

From MaRDI portal
Publication:2363990
Jump to:navigation, search

DOI10.1007/s11786-016-0283-zzbMath1378.68032arXiv1312.3422OpenAlexW1717915937MaRDI QIDQ2363990

Daniel Valenzuela, Giovanni Manzini, Travis Gagie

Publication date: 17 July 2017

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.3422


zbMATH Keywords

compressed data structuressimilarity searchspaced seedsrelative compressionspaced suffix arrays


Mathematics Subject Classification ID

Data structures (68P05)


Related Items (1)

Compressed spaced suffix arrays


Uses Software

  • SHRiMP
  • BFAST
  • PatternHunter


Cites Work

  • Unnamed Item
  • Better spaced seeds using quadratic residues
  • Efficient fully-compressed sequence representations
  • Masking patterns in sequences: A new class of motif discovery with don't cares
  • Lossless filter for multiple repetitions with Hamming distance
  • Decomposing a set of points into chains, with applications to permutation and circle graphs
  • Compressed spaced suffix arrays
  • Alphabet-Independent Compressed Text Indexing
  • Indexing compressed text
  • Succinct de Bruijn Graphs


This page was built for publication: Compressed spaced suffix arrays

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2363990&oldid=14976574"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 18:36.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki