Results 51 to 60 of about 40,634 (160)
Consistency of Feature Markov Processes [PDF]
We are studying long term sequence prediction (forecasting). We approach this by investigating criteria for choosing a compact useful state representation. The state is supposed to summarize useful information from the history.
Hutter, Marcus, Sunehag, Peter
core +2 more sources
Finding all maximal perfect haplotype blocks in linear time
Recent large-scale community sequencing efforts allow at an unprecedented level of detail the identification of genomic regions that show signatures of natural selection.
Jarno Alanko +4 more
doaj +1 more source
On Correlation Polynomials and Subword Complexity [PDF]
We consider words with letters from a $q-ary$ alphabet $\mathcal{A}$. The kth subword complexity of a word $w ∈\mathcal{A}^*$ is the number of distinct subwords of length $k$ that appear as contiguous subwords of $w$.
Irina Gheorghiciuc, Mark Daniel Ward
doaj +1 more source
Converting Suffix Trees into Factor/Suffix Oracles [PDF]
The factor/suffix oracle is an automaton introduced by Allauzen, Crochemore and Raffinot. It is built for a given sequence s on an alphabet , and it weakly recognizes all the factors (the suffixes, respectively) of s : that is, it certainly recognizes ...
Rusu, Irena
core +1 more source
On the combinatorics of suffix arrays [PDF]
We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our approach is based on the characterization of Burrows-Wheeler arrays given
Kucherov, Gregory +2 more
core +5 more sources
Loanwords and Linguistic Phylogenetics: *pelek̑u‐ ‘axe’ and *(H)a(i̯)g̑‐ ‘goat’1
Abstract This paper assesses the role of borrowings in two different approaches to linguistic phylogenetics: Traditional qualitative analyses of lexemes, and quantitative computational analysis of cognacy. It problematises the assumption that loanwords can be excluded altogether from datasets of lexical cognacy.
Simon Poulsen
wiley +1 more source
Succinct Dictionary Matching With No Slowdown [PDF]
The problem of dictionary matching is a classical problem in string matching: given a set S of d strings of total length n characters over an (not necessarily constant) alphabet of size sigma, build a data structure so that we can match in a any text T ...
A.V. Aho +6 more
core +1 more source
James Platt Junior's Contributions to Old English Grammar1
Abstract In 1883, Henry Sweet took issue with James Platt junior, a 21‐year‐old language enthusiast. At the time, Platt was England's brightest young prospect in Old English linguistic studies. Sweet recognised Platt's talent, but he became convinced that he was also a plagiarist and tried to have him expelled from the Philological Society.
Stephen Laker
wiley +1 more source
In this thesis we investigate two main topics, namely, suffix trees and graph packing problems. In Chapter 2, we present the suffix trees. The main result of this chapter is a lower bound on the size of simple suffix trees.
Vásárhelyi Bálint Márk
core
Integrated methylome–transcriptome–microbiome analysis of AD skin identified thousands of DMRs. Rho GTPase signaling and actin–junctional programs emerged as central hubs integrating immune, epithelial, and microbial interactions in the pathogenesis of atopic dermatitis.
Tiina Skoog +22 more
wiley +1 more source

