Results 71 to 80 of about 3,800 (211)
Computing Suffix Links for Suffix Trees and Arrays [PDF]
We present a new and simple algorithm to reconstruct suffix links in suffix trees and suffix arrays. The algorithm is based on observations regarding suffix tree construction algorithms.
Moritz G. Maaß
core
Efficient implementation of lazy suffix trees [PDF]
Giegerich R, Kurtz S, Stoye J. Efficient implementation of lazy suffix trees. In: Algorithm Engineering. 3rd International Workshop, WAE’99 London, UK, July 19–21, 1999 Proceedings. LNCS. Vol 1668. 1999: 30-42.We present an efficient implementation of a
Jens Stoye +5 more
core +1 more source
Constructing Chromosome Scale Suffix Trees [PDF]
Suffix trees have been the focus of significant research interest as they permit very efficient solutions to a range of string and sequence searching problems. Given a suffix tree that encodes a particular string, it is possible to solve problems such as
Dr Brown School
core
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
The new approach of multiple genome sequence matching based on GPU
Suffix trees and suffix arrays have been used widely in bioinformatics applications, especially for DNA sequence alignments in the initial exact match phase of heuristic algorithms.
DING Sha, ZHAO Shi-Yuan, LIN Tao
doaj
ABSTRACT As a periodization that is generally understood to refer to an era of Terrestrial relationships that developed with modernization and nuclearization, the Anthropocene cannot be applied simply to premodern histories and texts. However, it has introduced historians to geological periodization as a mode of describing periods of changed ...
Gwenffrewi J. Morgan
wiley +1 more source
Constructing chromosome scale suffix trees [PDF]
© 2004, Australian Computer Society Inc.Suffix trees have been the focus of significant research interest as they permit very efficient solutions to a range of string and sequence searching problems.
Brown, A.
core
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
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
How generics obscure the logic of conditionals
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

