Results 21 to 30 of about 39,701 (283)
Analisi sperimentale delle prestazioni di un suffix tree troncato [PDF]
Le strutture dati sono un ambito di ricerca estremamente vivo, poiché adatte a risolvere un ampio numero di problemi d'indicizzazione. Tra le varie strutture dati, particolare rilevanza hanno le strutture dati basate sui suffissi, che si prestano ...
Zucchetto, Daniel
core
Efficient computation of absent words in genomic sequences [PDF]
Herold J, Kurtz S, Giegerich R. Efficient computation of absent words in genomic sequences. BMC Bioinformatics. 2008;9(1): 167.Background: Analysis of sequence composition is a routine task in genome research.
Kurtz Stefan +8 more
core +1 more source
The cognitive processing of the allomorphy in Serbian [PDF]
In this work, we explored cognitive status of suffix allomorphy of the masculine nouns in instrumental singular in Serbian language (eg. mišom-mišem; pužom-pužem). Allomorphy represents distinct variations in form of the morpheme which does not influence
Jovanović Tamara +2 more
doaj +1 more source
On An Improved Parallel Construction Of Suffix Arrays For Low Bandwidth Pc-Cluster. [PDF]
An algorithm for the parallel construction of suffix arrays generation for any texts with larger alphabet size on distributed memory architecture is ...
Md. Ali, Norhashidah +3 more
core +1 more source
INTERFERENSI BAHASA BETAWI DALAM CERPEN MAHASISWA JURUSAN PBSI FITK UIN SYARIF HIDAYATULLAH JAKARTA
This study tried to see how far the interference of Betawi language in Department of Education Indonesian Language and Literature students’ short story, Faculty of Tarbiya and Teaching Sciences, Syarif Hidayatullah State Islamic University of ...
Siti Sahara
doaj +1 more source
On the Suffix Automaton with Mismatches [PDF]
In this paper we focus on the construction of the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of Sk in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition
M. CROCHEMORE +3 more
openaire +4 more sources
Inspired by a series of papers initiated in 2015 by Berthé et al., we introduce a new condition called suffix-connectedness. We show that the groups generated by the return sets of a uniformly recurrent suffix-connected language lie in a single conjugacy class of subgroups of the free group.
openaire +4 more sources
Fast index based algorithms and software for matching position specific scoring matrices [PDF]
Beckstette M, Homann R, Giegerich R, Kurtz S. Fast index based algorithms and software for matching position specific scoring matrices. BMC Bioinformatics.
Kurtz Stefan +11 more
core +1 more source
Janus Reactivity of a Mononuclear Non‐Heme Iron(III)‐Peroxo Complex Toward Indole Oxidation
The iron(III)‐peroxo complex [FeIII(O2)(12‐TMC)]+ exhibits bifurcating pathways in indole oxidation. N─H indoles undergo N─H H‐atom abstraction, supported by a KIE of 5.2 for N─H/N–D 2,3‐dimethylindoles, whereas N‐methylindoles react via electrophilic addition of the iron‐peroxo group to the C2–C3 double bond of the indole ring, forming iron ...
Wenjuan Zhu +4 more
wiley +2 more sources
Förnybart, reliabelt och tvåsamt föräldraskap. Om subjektiv och objektiv produktivitet hos några suffix [PDF]
Förnybart, reliabelt och tvåsamt föräldraskap. Artikel i Gäller stam, suffix och ord. Festskrift till Martin Gellerstam den 15 oktober 2001. (Meijerbergs arkiv för svensk ordforskning 29.
Malmgren, Sven-Göran
core +1 more source

