Invertebrate
发表于 2025-3-25 05:47:32
Fixed Block Compression Boosting in FM-Indexes,s to the underlying text. Among the best compressed self-indexes, in theory and in practice, are several members of the FM-index family. In this paper, we describe new FM-index variants that combine nice theoretical properties, simple implementation and improved practical performance. Our main resul
ARM
发表于 2025-3-25 09:50:46
Space Efficient Wavelet Tree Construction,avelet trees, based on in-place sorting, that use virtually no extra space. Furthermore, we implement and confirm that these algorithms are practical by comparing them to a known construction algorithm. This represents a step forward for practical space-efficient data structures, by allowing their c
Irascible
发表于 2025-3-25 12:30:57
http://reply.papertrans.cn/88/8798/879714/879714_23.png
propose
发表于 2025-3-25 19:53:41
http://reply.papertrans.cn/88/8798/879714/879714_24.png
JIBE
发表于 2025-3-25 20:58:04
http://reply.papertrans.cn/88/8798/879714/879714_25.png
Compassionate
发表于 2025-3-26 01:50:55
http://reply.papertrans.cn/88/8798/879714/879714_26.png
平庸的人或物
发表于 2025-3-26 07:45:56
http://reply.papertrans.cn/88/8798/879714/879714_27.png
完全
发表于 2025-3-26 11:45:32
0302-9743 l Symposium on String Processing and Information Retrieval, SPIRE 2011, held in Pisa, Italy, in October 2011. The 30 long and 10 short papers together with 1 keynote presented were carefully reviewed and selected from 102 submissions. The papers are structured in topical sections on introduction to
CHOP
发表于 2025-3-26 15:54:54
Fast Computation of a String Duplication History under No-Breakpoint-Reuse,particular from analysis of complex gene clusters. The problem is also related to computing edit distance with block operations, but in our scenario the start of the history is not fixed, but chosen to minimize the distance measure.
Neuralgia
发表于 2025-3-26 17:58:08
Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem,l and .(. log.) time in total. The improvements are achieved using a new data structure for the fringe marked ancestor problem, a special case of the nearest marked ancestor problem, which may be of independent interest.