作者: BOAST 時間: 2025-3-21 22:36 作者: 織物 時間: 2025-3-22 02:12
The Changing Face of Web Searchst-growing revenue source for the companies that provide this service. Following a brief overview of the state of the art and how we got there, this talk covers a spectrum of technical challenges arising in web search - ranging from spam detection to auction mechanisms.作者: fluoroscopy 時間: 2025-3-22 08:09 作者: Blood-Vessels 時間: 2025-3-22 09:25
Searching for Gapped Palindromesoth classes, we propose algorithms that run in time .(.?+?.), where . is the number of output palindromes. Both algorithms can be extended to compute biological gapped palindromes within the same time bound.作者: projectile 時間: 2025-3-22 14:38 作者: projectile 時間: 2025-3-22 17:19
Finding Largest Well-Predicted Subset of Protein Structure Modelsd, and one of the most intuitive criteria requires us to find a . — a maximum subset of the model which matches the native structure [12]. The problem is solvable in .(..) time, albeit too slow for practical usage. We present a (1?+?.). distance approximation algorithm that runs in time .(..log./..)作者: GLIDE 時間: 2025-3-22 23:42 作者: Indicative 時間: 2025-3-23 03:52
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknotsthat, despite the problem is NP-hard, the algorithmic complexity adapts to the complexity of the RNA structures. Due to fixed parameter tractability, we can guarantee polynomial run-time for a parameter which is small in practice. Our algorithm can be considered as a generalization of the algorithm 作者: Sinus-Rhythm 時間: 2025-3-23 07:40
Faster Algorithm for the Set Variant of the String Barcoding Problemn strings represent a set of genomic sequences and the substrings serve as probes in a hybridisation experiment. In this paper, we study a variant of the string barcoding problem in which the substrings have to be chosen from a particular set of substrings of cardinality .. This variant can be also 作者: 提煉 時間: 2025-3-23 12:39
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statisticse the distribution of the results obtained by such probabilistic calculations. Although we introduce PAAs and the corresponding algorithm in a generic manner, our main concern is their application to pattern matching statistics, i.e. we study the distributions of the number of occurrences of a patte作者: SPURN 時間: 2025-3-23 15:42 作者: 積極詞匯 時間: 2025-3-23 18:27
Approximate String Matching with Address Bit Errors the setting where errors are introduced to the location component (.), rather than the more traditional setting, where errors are introduced to the content itself (..). In this paper, we consider the case where bits of . may be erroneously flipped, either in a consistent or transient manner. We for作者: 橢圓 時間: 2025-3-23 23:05 作者: 按時間順序 時間: 2025-3-24 03:23 作者: fatuity 時間: 2025-3-24 07:30 作者: 郊外 時間: 2025-3-24 13:32
On Compact Representations of All-Pairs-Shortest-Path-Distance Matricesins integers in [.]?∪?+?∞, its plain storage takes ..log(.?+?1) bits. However, a simple counting argument shows that (..???.)/2 bits are necessary to store .. In this paper we investigate the question of finding a succinct representation of . that requires .(..) bits of storage and still supports co作者: BLANC 時間: 2025-3-24 17:21
Computing Inverse ST in Linear Complexityts. However, the best result obtained so far for the inverse ST has a time complexity .(.log.) and a space complexity .(.), where . and . are the text size and the context order of the transform, respectively. In this paper, we present a novel algorithm that can compute the inverse ST in an .(.) tim作者: Calibrate 時間: 2025-3-24 22:29 作者: 啞巴 時間: 2025-3-24 23:34 作者: 搜尋 時間: 2025-3-25 05:54
An(other) Entropy-Bounded Compressed Suffix Treeropy of the text does. Our development contains several novel ideas, such as compressing the longest common prefix information, and totally getting rid of the suffix tree topology, expressing all the suffix tree operations using range minimum queries and a new primitive called next/previous smaller value in a sequence.作者: Permanent 時間: 2025-3-25 07:31 作者: sulcus 時間: 2025-3-25 13:38 作者: 極微小 時間: 2025-3-25 17:35 作者: 野蠻 時間: 2025-3-25 21:47
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknotswe can guarantee polynomial run-time for a parameter which is small in practice. Our algorithm can be considered as a generalization of the algorithm of Jiang .?[1] to arbitrary pseudoknots. In their absence, it gracefully degrades to the same polynomial algorithm. A prototypical implementation demonstrates the applicability of the method.作者: 指令 時間: 2025-3-26 03:54
Approximate String Matching with Address Bit Errorsontent itself (..). In this paper, we consider the case where bits of . may be erroneously flipped, either in a consistent or transient manner. We formally define the corresponding approximate pattern matching problems, and provide efficient algorithms for their resolution, while introducing some novel techniques.作者: 柏樹 時間: 2025-3-26 08:11
Yinghui Zhao,Shanshan Li,Jiang Wu the classical problem, achieving average case .(.log../.) time with any ., where . is the text size, . the pattern length, . the number of errors for edit distance, and . the alphabet size. Our experimental results show the practicality of this novel and promising research direction.作者: white-matter 時間: 2025-3-26 09:09 作者: doxazosin 時間: 2025-3-26 13:18 作者: plasma-cells 時間: 2025-3-26 19:18 作者: 蛙鳴聲 時間: 2025-3-26 21:51
https://doi.org/10.1007/978-3-319-48296-5of scaling and rotation. The algorithm works in time .(....) for patterns of size .. and texts of size ... Our method can also be applied to the image matching problem, the well known issue in the image processing research.作者: 勛章 時間: 2025-3-27 03:50
Xiaofei Zhang,Xitong Guo,Kee-hung Lai,Yi Wurrences. To assess the practicability of our method, we apply it to the Prosite database of amino acid motifs and to the Jaspar database of transcription factor binding sites. Regarding the latter, we additionally show that our framework permits to take binding affinities predicted from a physical model into account.作者: 吞吞吐吐 時間: 2025-3-27 07:33 作者: judicial 時間: 2025-3-27 12:21
Analyzing mHeath Usage Using the mPower Datacontexts we explored for this work. These newly discovered cycle properties allow us to quickly compute the longest common prefix (LCP) between any pair of adjacent .-order contexts that may belong to two different cycles, leading to the proposed linear inverse ST algorithm.作者: 馬籠頭 時間: 2025-3-27 14:35 作者: 捕鯨魚叉 時間: 2025-3-27 19:06 作者: 可觸知 時間: 2025-3-28 00:24
Two-Dimensional Pattern Matching with Combined Scaling and Rotationof scaling and rotation. The algorithm works in time .(....) for patterns of size .. and texts of size ... Our method can also be applied to the image matching problem, the well known issue in the image processing research.作者: 蝕刻 時間: 2025-3-28 04:15 作者: 輕信 時間: 2025-3-28 06:22
A Black Box for Online Approximate Pattern Matchingcal measures such as the .. and .. norms. For these examples, the resulting online algorithms take .(log..), ., .(log../..), ., .(log..) and . time per character respectively. The space overhead is .(.) which we show is optimal.作者: capsaicin 時間: 2025-3-28 13:44
Computing Inverse ST in Linear Complexitycontexts we explored for this work. These newly discovered cycle properties allow us to quickly compute the longest common prefix (LCP) between any pair of adjacent .-order contexts that may belong to two different cycles, leading to the proposed linear inverse ST algorithm.作者: 繁重 時間: 2025-3-28 16:23
Dynamic Fully-Compressed Suffix Treese the disadvantage of being static, not supporting updates to the text. In this paper we show how to support dynamic FCSTs within the same optimal space of the static version and executing all the operations in polylogarithmic time. In particular, we are able to build the suffix tree within optimal space.作者: noxious 時間: 2025-3-28 20:35 作者: scrape 時間: 2025-3-29 00:52 作者: Flawless 時間: 2025-3-29 05:57 作者: 健壯 時間: 2025-3-29 09:41
Wei Zhao,Xitong Guo,Tianshi Wu,Jingxuan Gengstance. We achieve this result by reducing the storage of . to the succinct storage of labeled trees and ternary sequences, for which we properly adapt and orchestrate the use of known compressed data structures.作者: 放大 時間: 2025-3-29 14:50
Parameterized Algorithms and Hardness Results for Some Graph Motif Problemsre W[1]-complete with respect to the subgraph size. Answering an open question from the literature, we further show that the parameter “number of connected motif components” leads to W[1]-hardness even when restricted to graphs that are paths.作者: 起皺紋 時間: 2025-3-29 19:15
Finding Largest Well-Predicted Subset of Protein Structure Modelsits native structure in time .(.(loglog.?+?log1/.)/..). We have implemented our algorithms and results indicate our program finds much more matched pairs with less running time than TMScore, which is one of the most popular tools to assess the quality of predicted models.作者: 飛鏢 時間: 2025-3-29 20:41 作者: 不再流行 時間: 2025-3-30 03:16 作者: 貪婪性 時間: 2025-3-30 04:25
ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populationsthematical and practical results on phylogenetic networks with recombination and show applications of these results to several issues in Population Genomics..Various parts of this work are joint work with Satish Eddhu, Chuck Langley, Dean Hickerson, Yun S. Song, Yufeng Wu, V. Bansal, V. Bafna and Z.作者: 牢騷 時間: 2025-3-30 09:04
Conference proceedings 2008ns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivialcombinatorialproperties of suchstructures and to exploit these properties in order to either achieve superior performance for the cor- sponding computational problems or pinpoint conditions under 作者: 偽善 時間: 2025-3-30 13:54 作者: Tracheotomy 時間: 2025-3-30 19:01
0302-9743 tures and to exploit these properties in order to either achieve superior performance for the cor- sponding computational problems or pinpoint conditions under 978-3-540-69066-5978-3-540-69068-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Exaggerate 時間: 2025-3-30 22:58 作者: avarice 時間: 2025-3-31 01:45 作者: Assault 時間: 2025-3-31 07:32 作者: 是剝皮 時間: 2025-3-31 09:35
https://doi.org/10.1007/978-3-319-29175-8 number of inversions and translocations that transform one genome into the other. This paper presents a new distance formula based on a simple tree structure that captures all the delicate features of this problem in a unifying way.作者: unstable-angina 時間: 2025-3-31 17:10 作者: 偶像 時間: 2025-3-31 21:26 作者: 六邊形 時間: 2025-3-31 23:50 作者: ETCH 時間: 2025-4-1 04:03
HP Distance Via Double Cut and Join Distance number of inversions and translocations that transform one genome into the other. This paper presents a new distance formula based on a simple tree structure that captures all the delicate features of this problem in a unifying way.作者: Cabg318 時間: 2025-4-1 09:51 作者: itinerary 時間: 2025-4-1 13:19
https://doi.org/10.1007/978-3-540-69068-9Pattern Matching; algorithm; algorithms; biology; data compression; data mining; databases; pattern recogni作者: 利用 時間: 2025-4-1 17:33
