URL: https://github.com/y-256/libdivsufsort
Proper Citation: libdivsufsort (RRID:SCR_024079)
Description: Software library that implements lightweight suffix array construction algorithm. Provides C API to construct suffix array and Burrows-Wheeler transformed string from given string over constant size alphabet. The algorithm runs in O(n log n) worst-case time using only 5n+O(1) bytes of memory space, where n is the length of the string.
Synonyms: libdivsufsort: A lightweight suffix-sorting library
Resource Type: software toolkit, software library, software resource
Keywords: suffix array construction algorithm,
Expand Allis listed by |
We found {{ ctrl2.mentions.total_count }} mentions in open access literature.
We have not found any literature mentions for this resource.
We are searching literature mentions for this resource.
Most recent articles:
{{ mention._source.dc.creators[0].familyName }} {{ mention._source.dc.creators[0].initials }}, et al. ({{ mention._source.dc.publicationYear }}) {{ mention._source.dc.title }} {{ mention._source.dc.publishers[0].name }}, {{ mention._source.dc.publishers[0].volume }}({{ mention._source.dc.publishers[0].issue }}), {{ mention._source.dc.publishers[0].pagination }}. (PMID:{{ mention._id.replace('PMID:', '') }})
Check
for all resource mentions.
A list of researchers who have used the resource and an author search tool
Find mentions based on location
{{ ctrl2.mentions.errors.location }}
A list of researchers who have used the resource and an author search tool. This is available for resources that have literature mentions.
No rating or validation information has been found for libdivsufsort.
No alerts have been found for libdivsufsort.
Source: SciCrunch Registry
