荒唐
发表于 2025-3-23 12:06:44
http://reply.papertrans.cn/88/8798/879724/879724_11.png
invert
发表于 2025-3-23 15:01:34
http://reply.papertrans.cn/88/8798/879724/879724_12.png
Admonish
发表于 2025-3-23 19:45:12
Paweł Gawrychowski,Gregory Kucherov,Yakov Nekrich,Tatiana Starikovskaya
河流
发表于 2025-3-23 22:16:23
Oren Kurland,Moshe Lewenstein,Ely PoratProceedings of the 20th International Symposium on String Processing and Information Retrieval, SPIRE 2013
出血
发表于 2025-3-24 02:31:44
http://reply.papertrans.cn/88/8798/879724/879724_15.png
Prophylaxis
发表于 2025-3-24 07:56:53
String Processing and Information Retrieval978-3-319-02432-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
植物群
发表于 2025-3-24 11:23:37
http://reply.papertrans.cn/88/8798/879724/879724_17.png
高脚酒杯
发表于 2025-3-24 17:58:08
https://doi.org/10.1007/978-3-319-02432-5combinatorial algorithms; graphs; information retrieval; query processing; search engines; algorithm anal
发源
发表于 2025-3-24 21:47:47
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs,w how, given a tree containing two colours, we can build a quadratic-space index with which we can find a match in time proportional to the size of the match. We also show how we need only linear space if we are content with approximate matches.
overwrought
发表于 2025-3-25 00:13:09
Top-, Color Queries on Tree Paths,to efficiently answer queries for the top . distinct colors on the path between two nodes, reporting the colors sorted in descending order. Our data structure requires linear space of .(.) words and answers queries in .(.) time.