Results 21 to 30 of about 37,551,526 (314)

Transfer posterior error probability estimation for peptide identification

open access: yesBMC Bioinformatics, 2020
Background In shotgun proteomics, database searching of tandem mass spectra results in a great number of peptide-spectrum matches (PSMs), many of which are false positives.
Xinpei Yi, Fuzhou Gong, Yan Fu
doaj   +1 more source

A vision for smart and sustainable cities

open access: yesIET Smart Cities, 2021
Our built environment is characterized by large, ever‐expanding and highly complex cities. The spatial extent of the interconnected systems that serve these cities leads to higher vulnerability to disruption.
Amr Elnashai, Hussam Mahmoud
doaj   +1 more source

Compressed Data Structures for Dynamic Sequences [PDF]

open access: yes, 2015
We consider the problem of storing a dynamic string $S$ over an alphabet $\Sigma=\{\,1,\ldots,\sigma\,\}$ in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries: $\mathrm{access}(i,S ...
A. Gupta   +14 more
core   +1 more source

Concurrent Data Structures Linked in Time [PDF]

open access: yes, 2017
Arguments about correctness of a concurrent data structure are typically carried out by using the notion of linearizability and specifying the linearization points of the data structure's procedures.
Banerjee, Anindya   +3 more
core   +3 more sources

Multi-Dimensional Data Compression and Query Processing in Array Databases

open access: yesIEEE Access, 2022
In recent times, the production of multidimensional data in various domains and their storage in array databases has witnessed a sharp increase; this rapid growth in data volumes necessitates compression in array databases.
Minsoo Kim, Hyubjin Lee, Yon Dohn Chung
doaj   +1 more source

Probabilistic Data Structures in Adversarial Environments

open access: yesConference on Computer and Communications Security, 2019
Probabilistic data structures use space-efficient representations of data in order to (approximately) respond to queries about the data. Traditionally, these structures are accompanied by probabilistic bounds on query-response errors.
David Clayton   +2 more
semanticscholar   +1 more source

Partially complemented representations of digraphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2002
Special issue: Graph ...
Elias Dahlhaus   +2 more
doaj   +1 more source

Sketching and Sublinear Data Structures in Genomics

open access: yesAnnual Review of Biomedical Data Science, 2019
Large-scale genomics demands computational methods that scale sublinearly with the growth of data. We review several data structures and sketching techniques that have been used in genomic analysis methods.
G. Marçais   +3 more
semanticscholar   +1 more source

Seaborn: Statistical Data Visualization

open access: yesJournal of Open Source Software, 2021
seaborn is a library for making statistical graphics in Python. It provides a high-level interface to matplotlib and integrates closely with pandas data structures. Functions in the seaborn library expose a declarative, dataset-oriented API that makes it
Michael L. Waskom
semanticscholar   +1 more source

Partially persistent search trees with transcript operations [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 1999
When dictionaries are persistent, it is natural to introduce a transcript operation which reports the status changes for a given key over time. We discuss when and how a time and space efficient implementation of this operation can be provided.
Kim S. Larsen
doaj   +1 more source

Home - About - Disclaimer - Privacy