The oral metagenome in health and disease

P Belda-Ferre, LD Alcaraz, R Cabrera-Rubio… - The ISME …, 2012 - academic.oup.com
The oral cavity of humans is inhabited by hundreds of bacterial species and some of them
have a key role in the development of oral diseases, mainly dental caries and periodontitis …

Simple linear work suffix array construction

J Kärkkäinen, P Sanders - … ICALP 2003 Eindhoven, The Netherlands, June …, 2003 - Springer
A suffix array represents the suffixes of a string in sorted order. Being a simpler and more
compact alternative to suffix trees, it is an important tool for full text indexing and other string …

Improtek: introducing scenarios into human-computer music improvisation

J Nika, M Chemillier, G Assayag - Computers in Entertainment (CIE), 2017 - dl.acm.org
This article focuses on the introduction of control, authoring, and composition in human-
computer music improvisation through the description of a guided music generation model …

Boundary recognition in sensor networks by topological methods

Y Wang, J Gao, JSB Mitchell - Proceedings of the 12th annual …, 2006 - dl.acm.org
Wireless sensor networks are tightly associated with the underlying environment in which
the sensors are deployed. The global topology of the network is of great importance to both …

Space-efficient preprocessing schemes for range minimum queries on static arrays

J Fischer, V Heun - SIAM Journal on Computing, 2011 - SIAM
Given a static array of n totally ordered objects, the range minimum query problem is to build
a data structure that allows us to answer efficiently subsequent on-line queries of the form …

Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE

J Fischer, V Heun - Annual Symposium on Combinatorial Pattern Matching, 2006 - Springer
Abstract The Range-Minimum-Query-Problem is to preprocess an array such that the
position of the minimum element between two specified indices can be obtained efficiently …

[書籍][B] Advanced data structures

P Brass - 2008 - helloplanetcpp.wordpress.com
This book is a graduate-level textbook on data structures. A data structure is a method1 to
realize a set of operations on some data. The classical example is to keep track of a set of …

Compact labeling scheme for ancestor queries

S Abiteboul, S Alstrup, H Kaplan, T Milo… - SIAM Journal on …, 2006 - SIAM
We consider the following problem. Given a rooted tree T, label the nodes of T in the most
compact way such that, given the labels of two nodes u and v, one can determine in constant …

A fully dynamic reachability algorithm for directed graphs with an almost linear update time

L Roditty, U Zwick - Proceedings of the thirty-sixth annual ACM …, 2004 - dl.acm.org
We obtain a new fully dynamic algorithm for the reachability problem in directed graphs. Our
algorithm has an amortized update time of O (m+ n log n) and a worst-case query time of O …

Optimal parallel algorithms in the binary-forking model

GE Blelloch, JT Fineman, Y Gu, Y Sun - … of the 32nd ACM Symposium on …, 2020 - dl.acm.org
In this paper we develop optimal algorithms in the binary-forking model for a variety of
fundamental problems, including sorting, semisorting, list ranking, tree contraction, range …