Search results for "string"

Lightweight algorithms for constructing and inverting the BWT of string collections

2013

Recent progress in the field of \{DNA\} sequencing motivates us to consider the problem of computing the Burrows‚ÄìWheeler transform (BWT) of a collection of strings. A human genome sequencing experiment might yield a billion or more sequences, each 100 characters in length. Such a dataset can now be generated in just a few days on a single sequencing machine. Many algorithms and data structures for compression and indexing of text have the \{BWT\} at their heart, and it would be of great interest to explore their applications to sequence collections such as these. However, computing the \{BWT\} for 100 billion characters or more of data remains a computational challenge. In this work we ad…

Forbidden Factors and Fragment Assembly

2002

In this paper we approach the fragment assembly problem by using the notion of minimal forbidden factors introduced in previous paper. Denoting by M(w) the set of minimal forbidden factors of a word w, we first focus on the evaluation of the size of elements in M(w) and on designing of an algorithm to recover the word w from M(w). Actually we prove that for a word w randomly generated by a memoryless source with identical symbol probabilities, the maximal length m(w) of words in M(w) is logarithmic and that the reconstruction algorithm runs in linear time. These results have an interesting application to the fragment assembly problem, i.e. reconstruct a word w from a given set I of substrin…

Some Remarks on Automata Minimality

2011

It is well known that the minimization problem of deterministic finite automata (DFAs) is related to the indistinguishability notion of states (cf. [HMU00]). Indeed, a well known technique to minimize a DFA, essentially, consists in finding pairs of states that are equivalent (or indistinguishable), namely pairs of states (p,q) such that it is impossible to assert the difference between p and q only by starting in each of the two states and asking whether or not a given input string leads to a final state. Since, in the testing states equivalence, the notion of initial state is irrelevant, some of the main techniques for the minimization of automata, such as Moore’s algorithm [Moo56] and Ho…

CHEMICAL AND SENSORY CHARACTERISTICS OF FIVE LOQUAT CULTIVARS

2015

Fruit quality can be evaluated by combining chemical-physical and sensory analyses. In this trial, both instrumental and sensory analyses were carried out on fruit of 5 loquat cultivars (‘Nespolone di Trabia’, ‘Sanfilippara’, ‘Virticchiara’, ‘MarcenA²â€™ and ‘Golden Nugget’), with the aim of assessing their commercial quality. Fruit weight, transversal and longitudinal diameter, total soluble solid content (TSS), and titratable acidity (TA) were measured. In addition, a sensory profile of each cultivar was defined by a trained panel, which generated 16 attributes. The highest fruit weight was found in ‘Golden Nugget’ and ‘Sanfilippara’; the latter exhibited also th…

Fruit chemical and sensory characteristics of five loquat (Eriobotrya japonica Lindl) cultivars.

2014

All N=(8,0) AdS3 solutions in 10 and 11 dimensions

2021

We classify AdS(3) solutions preserving N = (8, 0) supersymmetry in ten and eleven dimensions and find the local form of each of them. These include the AdS(3)xS(6) solution of [1] and the embeddings of AdS(3) into AdS(4)xS(7), AdS(5)xS(5), AdS(7)/Z(k)xS(4) and its IIA reduction within AdS(7). More interestingly we find solutions preserving the superconformal algebras f4, su(1,1|4), osp(4*|4) on certain squashings of the 7-sphere. These solutions asymptote to AdS(4)xS(7) and are promising candidates for holographic duals to defects in Chern-Simons matter theories.

Report on cpm 2011 and stringmasters 2011

2011

Indexed Two-Dimensional String Matching

2016

Preface

2017

Designing for Exploratory Search on Touch Devices

2015

Exploratory search confront users with challenges in expressing search intents as the current search interfaces require investigating result listings to identify search directions, iterative typing, and reformulating queries. We present the design of Exploration Wall, a touch-based search user interface that allows incremental exploration and sense-making of large information spaces by combining entity search, flexible use of result entities as query parameters, and spatial configuration of search streams that are visualized for interaction. Entities can be flexibly reused to modify and create new search streams, and manipulated to inspect their relationships with other entities. Data compr…