Results 61 to 70 of about 40,634 (160)
Whole-Genome Alignment: Methods, Challenges, and Future Directions
Applied SciencesWhole-genome alignment (WGA) is a critical process in comparative genomics, facilitating the detection of genetic variants and aiding our understanding of evolution. This paper offers a detailed overview and categorization of WGA techniques, encompassing
Bacem Saada +4 more
doaj +1 more source
Dictionary Matching with One Gap
, 2014 The dictionary matching with gaps problem is to preprocess a dictionary $D$ of $d$ gapped patterns $P_1,\ldots,P_d$ over alphabet $\Sigma$, where each gapped pattern $P_i$ is a sequence of subpatterns separated by bounded sequences of don't cares.
A. Amir +19 more
core +1 more source
Compressed Representations of Permutations, and Applications [PDF]
, 2008 We explore various techniques to compress a permutation $\pi$ over n integers, taking advantage of ordered subsequences in $\pi$, while supporting its application $\pi$(i) and the application of its inverse $\pi^{-1}(i)$ in small time.
Barbay, Jérémy, Navarro, Gonzalo
core +7 more sources
Untangling nutrient co‐regulation of ombrotrophic peatland development
Boreas, EarlyView.Multi‐method (FTIR, FT‐NIR and TGA) approaches characterizing the organic peat constituents at Holcroft Moss reveal a record of switches that reflect broadly hydroclimate variability governing the decomposition patterns. There are periods, however, where hydroclimate does not fully explain the variability observed and instead changes appear linked to ...
Richard C. Chiverrell +6 more
wiley +1 more source
Algorithms for Molecular Biology, 2012 Background Chaos Game Representation (CGR) is an iterated function that bijectively maps discrete sequences into a continuous domain. As a result, discrete sequences can be object of statistical and topological analyses otherwise reserved to numerical ...
Vinga Susana +4 more
doaj +1 more source
Architecting Suffix Trees Using Electronic Modalities [PDF]
, 2018 The construction of kernels is a confusing problem. In our research, authors show the private unification of XML and hierarchical databases.
Dunagan, J. (Josie)
core
, 2013 This paper presents a general technique for optimally transforming any dynamic data structure that operates on atomic and indivisible keys by constant-time comparisons, into a data structure that handles unbounded-length keys whose comparison cost is not
Amir, Amihood +5 more
core +1 more source
Universal Compressed Text Indexing [PDF]
, 2018 The rise of repetitive datasets has lately generated a lot of interest in compressed self-indexes based on dictionary compression, a rich and heterogeneous family that exploits text repetitions in different ways. For each such compression scheme, several
Navarro, Gonzalo, Prezza, Nicola
core +2 more sources
How generics obscure the logic of conditionals
Mind &Language, EarlyView.This paper discusses counter‐examples to modus ponens and modus tollens involving modals and quantificational adverbs, and presents new counter‐examples with generic conditionals. We argue that the counter‐examples are spurious, and are explained by the domain‐restricting effects of if‐clauses.
Daniel Lassiter +3 more
wiley +1 more source
Suffix Trees Considered Harmful [PDF]
, 2018 The implications of adaptive theory have been far-reaching and pervasive. In this paper, au- thors demonstrate the evaluation of journaling file systems, which embodies the intuitive principles of programming languages.
Johnson, R. (Richard) +2 more
core