Results 61 to 70 of about 40,875 (196)
Finding all maximal perfect haplotype blocks in linear time
Algorithms for Molecular Biology, 2020 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
Mäetagused, 2014 The paper discusses the origins of the Estonian word jumal (‘God’). First, it summarises the versions proposed by previous treatises, and thereafter the linguistic material of Estonian runo songs is analysed in order to detect variations in its usage ...
Ene Vainik
doaj +1 more source
Converting Suffix Trees into Factor/Suffix Oracles [PDF]
, 2006 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
, 2014 This paper presents a formal characterisation of safety and liveness properties \`a la Alpern and Schneider for fully probabilistic systems. As for the classical setting, it is established that any (probabilistic tree) property is equivalent to a ...
Baier C. +9 more
core +5 more sources
Faster suffix tree construction with missing suffix links [PDF]
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000 Summary: We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for two-dimensional arrays. These trees also have the property that the node degrees may be large.
Cole, Richard, Hariharan, Ramesh
openaire +3 more sources
On Correlation Polynomials and Subword Complexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 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
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
Loanwords and Linguistic Phylogenetics: *pelek̑u‐ ‘axe’ and *(H)a(i̯)g̑‐ ‘goat’1
Transactions of the Philological Society, Volume 123, Issue 1, Page 116-136, March 2025.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
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
James Platt Junior's Contributions to Old English Grammar1
Transactions of the Philological Society, EarlyView.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