نتایج جستجو برای: k sorani has a suffix called
تعداد نتایج: 13654404 فیلتر نتایج به سال:
Document retrieval is one of the most fundamental problem in information retrieval. The objective is to retrieve all documents from a document collection that are relevant to an input pattern. Several variations of this problem such as ranked document retrieval, document listing with two patterns and forbidden patterns have been studied. We introduce the problem of document retrieval with forbi...
abstract translation has become a cultural act which plays a significant role in human life. with the emergence of functional translation theories, and skopos theory in particular, translation has been considered as a purposeful, interpersonal and intercultural activity which is produced for particular recipients and directed by a specific purpose. this purpose determines the translatio...
‘romanticism’ and ‘romantic’ are among the most controversial terms in literature. most readers, when encountering these words, would think of the well-known period of romanticism of the first three decades of the nineteenth century and the great six english poets known as ‘the big six’ of this period. however, romanticism does not belong to certain artists in a special period; one may seek ele...
UNLABELLED With advances in high-throughput sequencing methods, and the corresponding exponential growth in sequence data, it has become critical to develop scalable data management techniques for sequence storage, retrieval and analysis. In this paper we present a novel disk-based suffix tree approach, called TRELLIS+, that effectively scales to massive amount of sequence data using only a lim...
in this thesis, a structured hierarchical methodology based on petri nets is used to introduce a task model for a soccer goalkeeper robot. in real or robot soccer, goalkeeper is an important element which has a key role and challenging features in the game. goalkeeper aims at defending goal from scoring goals by opponent team, actually to prevent the goal from the opponent player’s attacks. thi...
A k-repeat is a stringwk=u∗ kv that matches more than one substring of x, where ∗ is the don’t care letter and k > 0.We propose an O(n log n)-time algorithm for computing all longest k-repeats in a given string x = x[1..n]. The proposed algorithm uses suffix trees to fulfill this task and relies on the ability to answer lowest common ancestor queries in constant time. © 2006 Elsevier B.V. All r...
We introduce a new heuristic for the multiple alignment of a set of sequences. The heuristic is based on a set cover of the residue alphabet of the sequences, and also on the determination of a significant set of blocks comprising subsequences of the sequences to be aligned. These blocks are obtained with the aid of a new data structure, called a suffix-set tree, which is constructed from the i...
New words are constantly entering language. When a new word is formed by the combination of existing morphemes, it is expected to follow languagespecific structural patterns called selectional restrictions. If a new word follows these restrictions, then it can be considered to be morphologically legal, and if it violates these restrictions, then it can be said to be morphologically illegal. For...
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S(1), ... , S(k) is a string that occurs at most t(i)-times in the sequence S(i), where the t(i) > 0 are user-defined thresholds. First, the suffix tree of one of the sequences (the reference sequence) is built, and then the other sequences are matched s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید