Search results for "data structure"

Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices

1999

AbstractWe describe fast parallel algorithms for building index data structures that can be used to gather various statistics on square matrices. The main data structure is the Lsuffix tree, which is a generalization of the classical suffix tree for strings. Given ann×ntext matrixA, we build our data structures inO(logn) time withn2processors on a CRCW PRAM, so that we can quickly processAin parallel as follows: (i) report some statistical information aboutA, e.g., find the largest repeated square submatrices that appear at least twice inAor determine, for each position inA, the smallest submatrix that occurs only there; (ii) given, on-line, anm×mpattern matrixPAT, check whether it occurs i…

kmcEx: memory-frugal and retrieval-efficient encoding of counted k-mers.

2018

Abstract Motivation K-mers along with their frequency have served as an elementary building block for error correction, repeat detection, multiple sequence alignment, genome assembly, etc., attracting intensive studies in k-mer counting. However, the output of k-mer counters itself is large; very often, it is too large to fit into main memory, leading to highly narrowed usability. Results We introduce a novel idea of encoding k-mers as well as their frequency, achieving good memory saving and retrieval efficiency. Specifically, we propose a Bloom filter-like data structure to encode counted k-mers by coupled-bit arrays—one for k-mer representation and the other for frequency encoding. Exper…

Building up adjusted indicators of students' evaluation of university courses using generalized item response models

2012

This article advances a proposal for building up adjusted composite indicators of the quality of university courses from students’ assessments. The flexible framework of Generalized Item Response Models is adopted here for controlling the sources of heterogeneity in the data structure that make evaluations across courses not directly comparable. Specifically, it allows us to: jointly model students’ ratings to the set of items which define the quality of university courses; explicitly consider the dimensionality of the items composing the evaluation form; evaluate and remove the effect of potential confounding factors which may affect students’ evaluation; model the intra-cluster variabilit…

Contributed discussion on article by Pratola

2016

The author should be commended for his outstanding contribution to the literature on Bayesian regression tree models. The author introduces three innovative sampling approaches which allow for efficient traversal of the model space. In this response, we add a fourth alternative.

Recent applications of point process methods in forestry statistics

2000

Forestry statistics is an important field of applied statistics with a long tradition. Many forestry problems can be solved by means of point processes or marked point processes. There, the "points" are tree locations and the "marks" are tree characteristics such as diameter at breast height or degree of damage by environmental factors. Point pro- cess characteristics are valuable tools for exploratory data analysis in forestry, for describing the variability of forest stands and for under- standing and quantifying ecological relationships. Models of point pro- cesses are also an important basis of modern single-tree modeling, that gives simulation tools for the investigation of forest stru…

Flexible strategic planning of transport systems

2012

Abstract This paper presents a decision support methodology for long-range planning of transport systems that exhibits strategic flexibility and stochastic system parameters. Unlike one-off strategic decisions, flexible decisions should be dynamically reformulated with time. The proposed methodology is based on the construction of a tree structure of multiple interlinked tactical planning problems, each associated with a scenario in the tree, where problems under scenarios at intermediate dates incorporate in their formulation the solution of the corresponding problems associated with past (future) connected scenarios. The resulting tree structure of interconnected planning decisions become…

Repetitiveness Measures based on String Attractors and Burrows-Wheeler Transform: Properties and Applications

2023

TB-Structure: Collective Intelligence for Exploratory Keyword Search

2017

In this paper we address an exploratory search challenge by presenting a new (structure-driven) collaborative filtering technique. The aim is to increase search effectiveness by predicting implicit seeker’s intents at an early stage of the search process. This is achieved by uncovering behavioral patterns within large datasets of preserved collective search experience. We apply a specific tree-based data structure called a TB (There-and-Back) structure for compact storage of search history in the form of merged query trails – sequences of queries approaching iteratively a seeker’s goal. The organization of TB-structures allows inferring new implicit trails for the prediction of a seeker’s i…

Boolean operations with implicit and parametric representation of primitives using R-functions

2005

We present a new and efficient algorithm to accurately polygonize an implicit surface generated by multiple Boolean operations with globally deformed primitives. Our algorithm is special in the sense that it can be applied to objects with both an implicit and a parametric representation, such as superquadrics, supershapes, and Dupin cyclides. The input is a constructive solid geometry tree (CSG tree) that contains the Boolean operations, the parameters of the primitives, and the global deformations. At each node of the CSG tree, the implicit formulations of the subtrees are used to quickly determine the parts to be transmitted to the parent node, while the primitives' parametric definition …

SimpleBIM: From full ifcOWL graphs to simplified building graphs

2016

International audience; Recent research in semantic web technologies for the built environment has resulted in several proposals to further improve information exchange among stakeholders from the domain. Most notable is the production of several OWL ontologies that allow to capture building data in RDF graphs. For example, an ifcOWL ontology allows to capture IFC data in an RDF graph. As the building data is now available in a semantic graph with an explicit formal basis, it can be restructured and simplified so that it more easily matches the different requirements associated with practical use case scenarios. In this paper, we investigate several proposals and technological approaches to…