deteriorate
发表于 2025-3-21 18:58:33
书目名称String Processing and Information Retrieval影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0879717<br><br> <br><br>书目名称String Processing and Information Retrieval影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0879717<br><br> <br><br>书目名称String Processing and Information Retrieval网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0879717<br><br> <br><br>书目名称String Processing and Information Retrieval网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0879717<br><br> <br><br>书目名称String Processing and Information Retrieval被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0879717<br><br> <br><br>书目名称String Processing and Information Retrieval被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0879717<br><br> <br><br>书目名称String Processing and Information Retrieval年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0879717<br><br> <br><br>书目名称String Processing and Information Retrieval年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0879717<br><br> <br><br>书目名称String Processing and Information Retrieval读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0879717<br><br> <br><br>书目名称String Processing and Information Retrieval读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0879717<br><br> <br><br>
FLIRT
发表于 2025-3-22 00:06:58
http://reply.papertrans.cn/88/8798/879717/879717_2.png
Exaggerate
发表于 2025-3-22 04:28:45
Grammar Compressed Sequences with Rank/Select Supports ineffective. We introduce grammar-based representations for repetitive sequences, which use up to 10% of the space needed by representations based on statistical compression, and support direct access and rank/select operations within tens of microseconds.
HACK
发表于 2025-3-22 06:46:01
Efficient Indexing and Representation of Web Access Logsn in compressed form. Results show that web access logs can be represented using 0.85 to 1.03 times their original (plain) size, while executing most of the operations within a few tens of microseconds.
Ventilator
发表于 2025-3-22 09:55:10
Order Preserving Prefix Tableslements at the same positions in both sequences is the same. In this paper we present an efficient algorithm to construct an interesting and useful data structure, namely, prefix table, from the order preserving point of view.
Daily-Value
发表于 2025-3-22 13:11:14
A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Geof the Spliced Alignment Problem, called ., that involves more than one target sequence. Under a metric, this algorithm is proved to be a 3-approximation for the problem and its good practical results compare to those obtained by four heuristics already developed for the Multiple Spliced Alignment Problem.
任命
发表于 2025-3-22 17:05:40
Improved Filters for the Approximate Suffix-Prefix Overlap Problemo a suffix of the other. Välimäki et al. (Information and Computation, 2012) gave a solution to this problem based on suffix filters. In this work, we propose two improvements to the method of Välimäki et al. that reduce the running time of the computation.
metropolitan
发表于 2025-3-23 00:02:27
http://reply.papertrans.cn/88/8798/879717/879717_8.png
periodontitis
发表于 2025-3-23 02:17:20
http://reply.papertrans.cn/88/8798/879717/879717_9.png
conquer
发表于 2025-3-23 09:11:56
Succinct Indexes for Reporting Discriminating and Generic Words+ .) for Problem (i) and Problem (ii) respectively. In this paper, we describe succinct indexes of .log. + .(.log.) + .(.) bits space with near optimal query times i.e., .(. + loglog. + .) for both these problems.