FM-index

Known as: Feragina-Manzini index, Ferragina-Manzini index, Fm index 
In computer science, an FM-index is a compressed full-text substring index based on the Burrows-Wheeler transform, with some similarities to the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1982-2018
05101519822018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Compressed bit vectors supporting rank and select operations are the workhorse of compressed data structures. We propose a hybrid… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2011
2011
String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion… (More)
  • table 2
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
MOTIVATION Sequence assembly is a difficult problem whose importance has grown again recently as the cost of sequencing has… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2008
2008
A parallel design and implementation of FM-index is presented in this paper. In applications, the performance of the FM-index is… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Given a sequence <i>S</i> = <i>s</i><sub>1</sub><i>s</i><sub>2</sub>…<i>s</i><sub><i>n</i></sub> of integers smaller than <i>r</i… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2006
2006
In an earlier work [6] we presented a simple FM-index variant, based on the idea of Huffman-compressing the text and then… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2005
2005
We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We show that, by combining an existing compression boosting technique with the wavelet tree data structure, we are able to design… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
2004
2004
The FM-index is a succinct text index needing only O(Hkn) bits of space, where n is the text size and Hk is the kth order entropy… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The size of electronic data is currently growing at a faster rate than computer memory and disk storage capacities. For this… (More)
  • figure 1
  • table 1
  • table 3
  • table 4
  • table 2
Is this relevant?