作者: 加劇 時間: 2025-3-21 22:46
0302-9743 Overview: 978-3-540-22341-2978-3-540-27801-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Macronutrients 時間: 2025-3-22 04:12
Power Electronics and Power Systemstionaries for data compression and does not need to retain the input string, differently from other methods based on compact automata. The net effect is that of obtaining a lighter automaton than the directed acyclic word graph (DAWG) of Blumer et?al., as it uses less nodes, still with arcs labeled by single characters.作者: Neuralgia 時間: 2025-3-22 05:06 作者: omnibus 時間: 2025-3-22 11:49 作者: 擔心 時間: 2025-3-22 15:50
Real-Time String Matching in Sublinear Space,We study a problem of efficient utilisation of extra memory space in real-time string matching. We propose, for any constant . >0, a real-time string matching algorithm claiming .(. .) extra space, where . is the size of a pattern. All previously known real-time string matching algorithms use Ω(.) extra space.作者: 擔心 時間: 2025-3-22 18:56 作者: Perigee 時間: 2025-3-22 23:30
Microgrids and Distributed Energy Future the application of the perfect phylogeny model to other problems in the design and analysis of genetic studies. We consider a novel type of data, xor-genotypes, which distinguish heterozygote from homozygote sites but do not identify the homozygote alleles. We show how to resolve xor-genotypes unde作者: 過渡時期 時間: 2025-3-23 03:06 作者: 思想流動 時間: 2025-3-23 09:25 作者: 金哥占卜者 時間: 2025-3-23 11:27
-Energy: Smart Demand-Side Energy Managemententire subtrees, as well as repeatedly removing a degree-2 node and adding the edge joining its two neighbors. In this paper we extend the Subtree Homeomorphism Problem to a new optimization problem by enriching the subtree-comparison with node-to-node similarity scores. The new problem, denoted . (作者: 典型 時間: 2025-3-23 16:08
Daphne Mah,Kaboo Po-yi Leung,Peter Hillsis called the . and it captures the “richness of the language” used in a sequence. For example, sequences with low complexity index contain a large number of repeated substrings and they eventually become periodic (e.g., tandem repeats in a DNA sequence). In order to identify unusually low- or high-作者: 尾巴 時間: 2025-3-23 20:54
https://doi.org/10.1007/978-3-319-98310-3 the pattern to a subset of the text. We introduce an approximate point set pattern matching for axis-sorted point sequences that allows a translation, space insertions and deletions between points. We present an approximate pattern matching algorithm that runs with pattern size . and text size . in作者: SNEER 時間: 2025-3-23 23:28 作者: Libido 時間: 2025-3-24 04:04
Jakob Stoustrup,Anuradha Annaswamy,Zhihua Qungs . .,. . ,...,. . of length . minimizing . such that for each . . ∈ ., there is a length-. substring . . (closest substring) of . . with min . .(. .,. .)?≤?.. We give a PTAS for this problem, for .=.(1).. . . problem: find . median strings . .,. . ,...,. . of length . and a substring . . (consens作者: refine 時間: 2025-3-24 10:34
Power Electronics and Power Systemstionaries for data compression and does not need to retain the input string, differently from other methods based on compact automata. The net effect is that of obtaining a lighter automaton than the directed acyclic word graph (DAWG) of Blumer et?al., as it uses less nodes, still with arcs labeled 作者: 手榴彈 時間: 2025-3-24 11:50 作者: esthetician 時間: 2025-3-24 16:05
Smart Grid Security: Attacks and Defensesic variation of the sequence similarity problem is the incremental string comparison problem, denoted ., which is, given two strings . and ., to compute the alignment solution of each suffix of . versus ...Here, we present two solutions to the Consecutive Suffix Alignment Problem under the LCS metri作者: Cloudburst 時間: 2025-3-24 20:11 作者: 博識 時間: 2025-3-25 01:19
Takanori Ida,Makoto Tanaka,Koichiro Itoinput trees restricted to these leaves are isomorphic, resp. have a common refinement. For ., resp. ., on . rooted trees, we give an .(.{3. .,2.27.+. .}) exact algorithm, where . is the smallest number of leaves to remove from input trees in order for these trees to be isomorphic, resp. to admit a c作者: 一起平行 時間: 2025-3-25 04:05
Takanori Ida,Makoto Tanaka,Koichiro Itosomorphism or homeomorphism) in all of the input trees with as many labeled leaves as possible. We study the ordered variants of MAST where the trees are uniformly or non-uniformly ordered. We provide the first known polynomial-time algorithms for the uniformly and non-uniformly ordered homeomorphic作者: Palliation 時間: 2025-3-25 10:33 作者: 最低點 時間: 2025-3-25 13:49
Takanori Ida,Makoto Tanaka,Koichiro Itootein structure with amino acid residues via its ., . a . in which the amino acids are classified as . (H) or . (P), . an .Φ defined in terms of the target structure that should . sequences with a . and . those with . (in the Canonical model, the energy function Φ gives an H-H residue contact in the作者: ILEUM 時間: 2025-3-25 18:08 作者: DOTE 時間: 2025-3-25 21:06
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229999.jpg作者: SLAY 時間: 2025-3-26 01:59
https://doi.org/10.1007/b983773D; Alignment; DOM; Multimedia; algorithms; approximation; combinatorial pattern matching; complexity; data 作者: 袖章 時間: 2025-3-26 06:34
978-3-540-22341-2Springer-Verlag Berlin Heidelberg 2004作者: 左右連貫 時間: 2025-3-26 10:00
Michael Valocchi,John Juliano,Allan Schurrs for circular sequences. We give lower and upper bounds as well as guaranteed approximation ratios for these three cases. The main result in this paper is an optimal polynomial-time algorithm for sorting circular 0/1 sequences when the cost function is additive.作者: colony 時間: 2025-3-26 15:01
Smart Grid Applications and Developmentsrithm offers a performance guarantee: the sensitivity of a chosen seed set is at least 70% of what can be achieved, in most reasonable models of homologous sequences. Our method achieves performance comparable to that of a greedy algorithm, but our work gives this area a mathematical foundation.作者: 火海 時間: 2025-3-26 18:23
,Energy Systems Today and?Tomorrow, theoretic model (NLG) for analyzing algorithms based on this approach, prove that the RNA multiple alignment problem is NP-Complete in this model, and present a polynomial time algorithm that approximates the optimal structure of size . within a factor of .(log. .).作者: cravat 時間: 2025-3-27 00:46
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity,s for circular sequences. We give lower and upper bounds as well as guaranteed approximation ratios for these three cases. The main result in this paper is an optimal polynomial-time algorithm for sorting circular 0/1 sequences when the cost function is additive.作者: Brain-Waves 時間: 2025-3-27 03:34 作者: Gene408 時間: 2025-3-27 08:39
A Computational Model for RNA Multiple Structural Alignment, theoretic model (NLG) for analyzing algorithms based on this approach, prove that the RNA multiple alignment problem is NP-Complete in this model, and present a polynomial time algorithm that approximates the optimal structure of size . within a factor of .(log. .).作者: Compass 時間: 2025-3-27 13:16 作者: 說笑 時間: 2025-3-27 14:10 作者: Asperity 時間: 2025-3-27 21:36
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem, variants as well as the uniformly and non-uniformly ordered isomorphic variants of MAST. Our algorithms run in time .(. .), .(. . min { ., .?+?log. . }), .(. .), and .((.+.). .), respectively, where . is the number of leaf labels and . is the number of input trees.作者: Pruritus 時間: 2025-3-27 23:44
Necmi Altin,Süleyman Emre Eyimayame data structure as a previous random approximation algorithm, we achieve the same subquadratic complexity for finding an . optimal solution. This answers an open question by Ozery-Flato and Shamir whether a subquadratic complexity could ever be achieved for solving the problem.作者: 貞潔 時間: 2025-3-28 04:18 作者: 僵硬 時間: 2025-3-28 09:21
https://doi.org/10.1007/978-3-319-98310-3echnique achieving .(./log . + . log .) time is also provided. Furthermore, as a natural extension we present an approximate point set pattern matching on the plane, and give a polynomial-time algorithm that solves this problem.作者: Modify 時間: 2025-3-28 11:47 作者: 一罵死割除 時間: 2025-3-28 17:50
Sorting by Reversals in Subquadratic Time,me data structure as a previous random approximation algorithm, we achieve the same subquadratic complexity for finding an . optimal solution. This answers an open question by Ozery-Flato and Shamir whether a subquadratic complexity could ever be achieved for solving the problem.作者: 流行 時間: 2025-3-28 19:01
Approximate Labelled Subtree Homeomorphism,describe an .(. . ./ log . + . log .) algorithm for solving . on unordered, unrooted trees, where . and . are the number of vertices in . and ., respectively. We also give an .(.) algorithm for rooted ordered trees.作者: 我悲傷 時間: 2025-3-28 23:05
Approximate Point Set Pattern Matching on Sequences and Planes,echnique achieving .(./log . + . log .) time is also provided. Furthermore, as a natural extension we present an approximate point set pattern matching on the plane, and give a polynomial-time algorithm that solves this problem.作者: 脫水 時間: 2025-3-29 03:12 作者: 水土 時間: 2025-3-29 09:01 作者: abduction 時間: 2025-3-29 15:11 作者: Ascendancy 時間: 2025-3-29 15:53 作者: nonplus 時間: 2025-3-29 23:37 作者: stress-response 時間: 2025-3-30 02:46 作者: guardianship 時間: 2025-3-30 05:34 作者: 解凍 時間: 2025-3-30 12:13
Optimizing Multiple Spaced Seeds for Homology Search,s can have better sensitivity and specificity than single seeds. We describe a linear programming-based algorithm to optimize a set of seeds. Our algorithm offers a performance guarantee: the sensitivity of a chosen seed set is at least 70% of what can be achieved, in most reasonable models of homol作者: 熱心 時間: 2025-3-30 14:46
Approximate Labelled Subtree Homeomorphism,entire subtrees, as well as repeatedly removing a degree-2 node and adding the edge joining its two neighbors. In this paper we extend the Subtree Homeomorphism Problem to a new optimization problem by enriching the subtree-comparison with node-to-node similarity scores. The new problem, denoted . (作者: 性行為放縱者 時間: 2025-3-30 17:40 作者: prostatitis 時間: 2025-3-30 21:44
Approximate Point Set Pattern Matching on Sequences and Planes, the pattern to a subset of the text. We introduce an approximate point set pattern matching for axis-sorted point sequences that allows a translation, space insertions and deletions between points. We present an approximate pattern matching algorithm that runs with pattern size . and text size . in作者: 西瓜 時間: 2025-3-31 03:51 作者: NATAL 時間: 2025-3-31 07:45 作者: 撫育 時間: 2025-3-31 12:04
A Trie-Based Approach for Compacting Automata,tionaries for data compression and does not need to retain the input string, differently from other methods based on compact automata. The net effect is that of obtaining a lighter automaton than the directed acyclic word graph (DAWG) of Blumer et?al., as it uses less nodes, still with arcs labeled 作者: 濕潤 時間: 2025-3-31 16:24 作者: Confirm 時間: 2025-3-31 17:30 作者: 前奏曲 時間: 2025-4-1 01:06
