Search results for "ALGORITHM"
showing 10 items of 4887 documents
Quantum Algorithm for Dyck Language with Multiple Types of Brackets
2021
We consider the recognition problem of the Dyck Language generalized for multiple types of brackets. We provide an algorithm with quantum query complexity \(O(\sqrt{n}(\log n)^{0.5k})\), where n is the length of input and k is the maximal nesting depth of brackets. Additionally, we show the lower bound for this problem which is \(\varOmega (\sqrt{n}c^{k})\) for some constant c.
A generalization of Sardinas and Patterson's algorithm to z-codes
1993
Abstract This paper concerns the framework of z-codes theory. The main contribution consists in an extension of the algorithm of Sardinas and Patterson for deciding whether a finite set of words X is a z-code. To improve the efficiency of this test we have found a tight upper bound on the length of the shortest words that might have a double z-factorization over X. Some remarks on the complexity of the algorithm are also given. Moreover, a slight modification of this algorithm allows us to compute the z-deciphering delay of X.
O(n 2 log n) Time On-Line Construction of Two-Dimensional Suffix Trees
2005
The two-dimensional suffix tree of an n × n square matrix A is a compacted trie that represents all square submatrices of Ai¾?[9]. For the off-line case, i.e., A is given in advance to the algorithm, it is known how to build it in optimal time, for any type of alphabet sizei¾?[9,15]. Motivated by applications in Image Compressioni¾?[18], Giancarlo and Guaianai¾?[12] considered the on-line version of the two-dimensional suffix tree and presented an On2log2n-time algorithm, which we refer to as GG. That algorithm is a non-trivial generalization of Ukkonen's on-line algorithm for standard suffix trees [19]. The main contribution in this paper is an Olog n factor improvement in the time complex…
Quantum Identification of Boolean Oracles
2004
The oracle identification problem (OIP) is, given a set S of M Boolean oracles out of 2 N ones, to determine which oracle in S is the current black-box oracle. We can exploit the information that candidates of the current oracle is restricted to S. The OIP contains several concrete problems such as the original Grover search and the Bernstein-Vazirani problem. Our interest is in the quantum query complexity, for which we present several upper bounds. They are quite general and mostly optimal: (i) The query complexity of OIP is \(O(\sqrt{N {\rm log} M {\rm log} N}{\rm log log} M)\) for anyS such that M = |S| > N, which is better than the obvious bound N if M \(< 2^{N/log^3 N}\). (ii) It is \…
Fast and Simple Approximation of the Diameter and Radius of a Graph
2006
The increasing amount of data to be processed by computers has led to the need for highly efficient algorithms for various computational problems. Moreover, the algorithms should be as simple as possible to be practically applicable. In this paper we propose a very simple approximation algorithm for finding the diameter and the radius of an undirected graph. The algorithm runs in $O(m\sqrt{n})$ time and gives an additive error of $O(\sqrt{n})$ for a graph with n vertices and m edges. Practical experiments show that the results of our algorithm are close to the optimum and compare favorably to the 2/3-approximation algorithm for the diameter problem by Aingworth et al [1].
Selection in captive populations
1986
We have briefly reviewed types of genetic variation and selection in the wild as contrasted with selection in captive populations, along with the objectives of captive breeding programs, before recommending selection procedures for the genetic management of captive populations. Although some inadvertent selection for tameness and adaptation to captive environments is inevitable in captive populations, any selection that is actively applied to captive populations should have clearly defined objectives. Much of the apparent disagreement about genetic management of captive populations probably stems from the varying objectives of different captive breeding programs. Objectives differ depending…
Using Redundant Visual Information From Different Dimensions for Attentional Selection
2012
The present study investigated the use of redundant information for attentional selection of a visual object. Each display contained two overlapping objects, and participants had to report the color of the occluding object. A baseline condition did not require object selection because the objects were identical. A single-cue condition required object selection based on spatial arrangement (i.e., occlusion) because the objects had the same shape. A double-cue condition afforded object selection by occlusion and shape because the objects consistently differed in shape. Behavioral results showed that the redundant shape cue facilitated attentional selection, although participants were never s…
Comparative genomics and protein domain graph analyses link ubiquitination and RNA metabolism.
2006
The human gene parkin, known to cause familial Parkinson disease, as well as several other genes, likely involved in other neurodegenerative diseases or in cancer, encode proteins of the RBR family of ubiquitin ligases. Here, we describe the structural diversity of the RBR family in order to infer their functional roles. Of particular interest is a relationship detected between RBR-mediated ubiquitination and RNA metabolism: a few RBR proteins contain RNA binding domains and DEAH-box RNA helicase domains. Global protein domain graph analyses demonstrate that this connection is not RBR-specific, but instead many other proteins contain both ubiquitination and RNA-related domains. These protei…
Role of Symbiosis in Evolution
2013
The biological relevance of the widespread prokaryote–eukaryote symbioses as a source of evolutionary innovation has been unveiled by the advent of the Genomic era, allowing deep knowledge on single or consortia uncultivable species. The establishment and maintenance of symbiosis are complex issues where partners’ fitness determines the evolutionary outcome. Comparative genomics allows to dissect the evolutionary process that begins with host invasion, takes the path from facultative to obligate symbiosis, and ends up in replacement or coexistence with new bacterial symbionts. Whole genomes of several intracellular bacterial symbionts have been sequenced, allowing the comparison among the d…
Mate choice for indirect genetic benefits: scrutiny of the current paradigm
2007
Summary 1Sexual selection through mate choice, and in particular female choice for indirect fitness benefits for their offspring, is a major paradigm that currently seems to enjoy almost unequivocal acceptance. A large body of theoretical work has been built to explain the evolution of mate choice in the absence of direct benefits, and the empiricists have enthusiastically verified the various assumptions and predictions of the theory. 2However, the relative importance of mate choice for indirect benefits in comparison to choice for direct benefits or to other mechanisms of sexual selection such as male–male competition or sensory exploitation remains a controversial issue, and this seems t…