Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Omer S. Sella

dblp:224/0747 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › storage devices › molecular data storage
DNA storage
0.912025
DNA data storage: A generative tool for Motif-based DNA storage · FAST 2025
Bioinformatics and computational biology
DNA storage
0.312025
DNA data storage: A generative tool for Motif-based DNA storage · FAST 2025

Methods — techniques the papers use, named apart from their topics

generative model · 1.7
YearPublicationVenuePosition
2025 DNA data storage: A generative tool for Motif-based DNA storage
Samira Brunmayr, Omer S. Sella, Thomas Heinis
FAST2
2021 DNA archival storage, a bottom up approach
abstract
DNA is an attractive medium for storage of digital data in the cloud, owing to a form factor several orders of magnitude smaller than any other. Key to storing binary data in synthetic in DNA is the translation between the binary representation of digital data to the quaternary domain of DNA. This translation must adhere to constraints imposed by the synthesis and sequencing processes used to write and read respectively. A technological advance in either process changes the constraints and renders current encoding schemes obsolete. In this paper we present a recipe for taking constraints and producing an appropriate encoding scheme. Such a mechanism allows moving the encoding in lockstep with the technological advances in the underlying processes. We further show a method to understand trade-offs in constraints for a given overhead of bits needed to meet such constraints.
Omer S. Sella, Amir Apelbaum, Thomas Heinis, Jasmine Quah, Andrew W. Moore 0002
HotStorage1