@misc{noauthor_fm-index_2018,
	title = {{FM}-index},
	copyright = {Creative Commons Attribution-ShareAlike License},
	url = {https://en.wikipedia.org/w/index.php?title=FM-index&oldid=855672131},
	abstract = {In computer science, an FM-index is a compressed full-text substring index based on the Burrows-Wheeler transform, with some similarities to the suffix array. It was created by Paolo Ferragina and Giovanni Manzini, who describe it as an opportunistic data structure as it allows compression of the input text while still permitting fast substring queries. The name stands for Full-text index in Minute space.It can be used to efficiently find the number of occurrences of a pattern within the compressed text, as well as locate the position of each occurrence. The query time, as well as the required storage space, has a sublinear complexity with respect to the size of the input data.
The original authors have devised improvements to their original approach and dubbed it "FM-Index version 2". A further improvement, the alphabet-friendly FM-index, combines the use of compression boosting and wavelet trees  to significantly reduce the space usage for large alphabets.
The FM-index has found use in, among other places, bioinformatics.},
	language = {en},
	urldate = {2018-10-10TZ},
	journal = {Wikipedia},
	month = aug,
	year = {2018},
	note = {Page Version ID: 855672131}
}

{"_id":"Bc6XgCz6QioPbXpYH","bibbaseid":"anonymous-fmindex-2018","downloads":0,"creationDate":"2019-03-12T12:17:24.821Z","title":"FM-index","author_short":null,"year":2018,"bibtype":"misc","biburl":"https://api.zotero.org/users/4077951/collections/RGGNGTPH/items?key=S19n3yt3sIbVqbNfPTMXwclK&format=bibtex&limit=100","bibdata":{"bibtype":"misc","type":"misc","title":"FM-index","copyright":"Creative Commons Attribution-ShareAlike License","url":"https://en.wikipedia.org/w/index.php?title=FM-index&oldid=855672131","abstract":"In computer science, an FM-index is a compressed full-text substring index based on the Burrows-Wheeler transform, with some similarities to the suffix array. It was created by Paolo Ferragina and Giovanni Manzini, who describe it as an opportunistic data structure as it allows compression of the input text while still permitting fast substring queries. The name stands for Full-text index in Minute space.It can be used to efficiently find the number of occurrences of a pattern within the compressed text, as well as locate the position of each occurrence. The query time, as well as the required storage space, has a sublinear complexity with respect to the size of the input data. The original authors have devised improvements to their original approach and dubbed it \"FM-Index version 2\". A further improvement, the alphabet-friendly FM-index, combines the use of compression boosting and wavelet trees to significantly reduce the space usage for large alphabets. The FM-index has found use in, among other places, bioinformatics.","language":"en","urldate":"2018-10-10TZ","journal":"Wikipedia","month":"August","year":"2018","note":"Page Version ID: 855672131","bibtex":"@misc{noauthor_fm-index_2018,\n\ttitle = {{FM}-index},\n\tcopyright = {Creative Commons Attribution-ShareAlike License},\n\turl = {https://en.wikipedia.org/w/index.php?title=FM-index&oldid=855672131},\n\tabstract = {In computer science, an FM-index is a compressed full-text substring index based on the Burrows-Wheeler transform, with some similarities to the suffix array. It was created by Paolo Ferragina and Giovanni Manzini, who describe it as an opportunistic data structure as it allows compression of the input text while still permitting fast substring queries. The name stands for Full-text index in Minute space.It can be used to efficiently find the number of occurrences of a pattern within the compressed text, as well as locate the position of each occurrence. The query time, as well as the required storage space, has a sublinear complexity with respect to the size of the input data.\nThe original authors have devised improvements to their original approach and dubbed it \"FM-Index version 2\". A further improvement, the alphabet-friendly FM-index, combines the use of compression boosting and wavelet trees to significantly reduce the space usage for large alphabets.\nThe FM-index has found use in, among other places, bioinformatics.},\n\tlanguage = {en},\n\turldate = {2018-10-10TZ},\n\tjournal = {Wikipedia},\n\tmonth = aug,\n\tyear = {2018},\n\tnote = {Page Version ID: 855672131}\n}\n\n","key":"noauthor_fm-index_2018","id":"noauthor_fm-index_2018","bibbaseid":"anonymous-fmindex-2018","urls":{"Paper":"https://en.wikipedia.org/w/index.php?title=FM-index&oldid=855672131"},"downloads":0},"search_terms":["index"],"keywords":[],"authorIDs":[],"dataSources":["Ybs75PfFuP3HaYX2R"]}