Titlebook: String Processing and Information Retrieval; 20th International S Oren Kurland,Moshe Lewenstein,Ely Porat Conference proceedings 2013 Sprin

荒唐

invert

Admonish

Paweł Gawrychowski,Gregory Kucherov,Yakov Nekrich,Tatiana Starikovskaya

河流

Oren Kurland,Moshe Lewenstein,Ely PoratProceedings of the 20th International Symposium on String Processing and Information Retrieval, SPIRE 2013

出血

Prophylaxis

String Processing and Information Retrieval978-3-319-02432-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

植物群

高脚酒杯

https://doi.org/10.1007/978-3-319-02432-5combinatorial algorithms; graphs; information retrieval; query processing; search engines; algorithm anal

发源

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

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.