作者: Occlusion 時間: 2025-3-21 23:52
Polynomial-time algorithm for computing translocation distance between genomes,ation distance. In this paper we prove a duality theorem leading to a polynomial algorithm for computing translocation distance for the case when the orientation of the genes are known. This leads to an algorithm generating a most parsimonious (shortest) scenario, transforming one genome into anothe作者: inquisitive 時間: 2025-3-22 00:52
Pattern-matching for strings with short descriptions,esent some sets of exponentially many positions in terms of feasibly many arithmetic progressions. The second tool is arithmetics: a simple application of Euclid algorithm. Hence a textual problem for exponentially long strings is reduced here to simple arithmetics on integers with (only) linearly m作者: inundate 時間: 2025-3-22 06:50
Faisal Tariq,Laurence S. Dooleystructure to one with known sequence and structure, thus attacking the structure prediction problem in the case when the structure of a closely related sequence is known. The techniques employed to prove our results include reductions to well-known string matching problems allowing wild cards and ra作者: 傾聽 時間: 2025-3-22 09:21
Smart Grids: Security and Privacy Issuesation distance. In this paper we prove a duality theorem leading to a polynomial algorithm for computing translocation distance for the case when the orientation of the genes are known. This leads to an algorithm generating a most parsimonious (shortest) scenario, transforming one genome into anothe作者: Endemic 時間: 2025-3-22 15:14 作者: Endemic 時間: 2025-3-22 17:54 作者: ineptitude 時間: 2025-3-22 22:45 作者: installment 時間: 2025-3-23 04:14 作者: obstruct 時間: 2025-3-23 06:05
0302-9743 n July 1995..CPM addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, extended expressions, etc. The aim is to derive non-trivial combinatorial properties in order to improve the performance of the corresponding computational problems. 作者: 惰性氣體 時間: 2025-3-23 12:45 作者: GET 時間: 2025-3-23 15:44
Bernd M. Buchholz,Zbigniew Styczynskih. We have made substantial improvements in the time and space usage of .. On some runs, we achieve an order of magnitude reduction in space usage and a significant multiplicative factor speedup in running time. To explain these improvements, we give a much more detailed description of . than has been previously available.作者: 關節(jié)炎 時間: 2025-3-23 19:01
Smart Grids: Security and Privacy Issuese .-., that takes advantage of structure that develops during the mapping process, thus catalyzing the discovery of all maximum, topologically valid matchings. We describe an algorithm based on this structure and present experimental data supporting its improved performance as compared with a naive approach.作者: Extricate 時間: 2025-3-23 23:48 作者: 整體 時間: 2025-3-24 05:57
Off-Grid Green Hydrogen Production Systemsntal bench biologist. So far, most queries for such analyses are issued on flat files and static indices. We discuss position tree structures and their potential in sequence data analysis. The hash position tree is introduced as a persistent, dynamic data structure for pattern searches in large sequence databases in biology.作者: HALL 時間: 2025-3-24 10:07 作者: Density 時間: 2025-3-24 13:39 作者: 出沒 時間: 2025-3-24 15:50 作者: 清醒 時間: 2025-3-24 22:27
Pairwise alignment with scoring on tuples,an have an arbitrary (but not complete) overlap..We show that, if the alphabets . and . are finite and . and . are constant, the resulting algorithms have the same asymptotic time and space complexity as their single symbol counterparts..This framework has been applied successfully to the codon-wise alignment of prokaryotic and eukaryotic genes.作者: 漸變 時間: 2025-3-25 01:15 作者: Physiatrist 時間: 2025-3-25 04:46 作者: condescend 時間: 2025-3-25 09:23
Smart Grids: Security and Privacy Issuesne of the trees can have an arbitrary degree. Finally, we consider the problem of optimally transforming a tree into another by transferring subtrees around. It is shown that computing the subtree-transfer distance is NP-hard and an approximation algorithm with performance ratio 3 is given.作者: 卡死偷電 時間: 2025-3-25 15:35 作者: 特別容易碎 時間: 2025-3-25 19:04
On the complexity of comparing evolutionary trees,ne of the trees can have an arbitrary degree. Finally, we consider the problem of optimally transforming a tree into another by transferring subtrees around. It is shown that computing the subtree-transfer distance is NP-hard and an approximation algorithm with performance ratio 3 is given.作者: Adornment 時間: 2025-3-25 23:30
0302-9743 ch as the design and analysis of algorithms for pattern matching problems in strings, graphs, and hypertexts, as well as in biological sequences and molecules.978-3-540-60044-2978-3-540-49412-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: LINES 時間: 2025-3-26 03:52
Energy Efficiency in a Mobile World the best existing method by Katzenelson, Pinter and Schenfeld by a factor of at least |.|. We also present an algorithm for the directed graph topological embedding problem which runs in time . and space .(|.|×|.|+|.|+|.|), where |.| is the number of nodes in the pattern graph .. To our knowledge, this algorithm is the first one for this problem.作者: 表示向前 時間: 2025-3-26 05:37 作者: Free-Radical 時間: 2025-3-26 11:11 作者: reperfusion 時間: 2025-3-26 15:24
Pattern matching in directed graphs, the best existing method by Katzenelson, Pinter and Schenfeld by a factor of at least |.|. We also present an algorithm for the directed graph topological embedding problem which runs in time . and space .(|.|×|.|+|.|+|.|), where |.| is the number of nodes in the pattern graph .. To our knowledge, this algorithm is the first one for this problem.作者: 感情脆弱 時間: 2025-3-26 19:01 作者: 謙卑 時間: 2025-3-26 21:39
Minimizing phylogenetic number to find good evolutionary trees,aracters), we can solve the second problem in polynomial time. We can also compute a fixed-topology 2-phylogeny (when one exists) for an arbitrary number of states. This algorithm can be used to further distinguish trees that are equal under parsimony. We also consider a number of other related problems.作者: 積云 時間: 2025-3-27 01:40 作者: 小母馬 時間: 2025-3-27 07:59
Fast approximate matching using suffix trees,instance, and .. is the size of the output. The running time is proportional to the amount of matching, in the worst case as fast as standard dynamic programming. The algorithm uses the suffix tree representation of the text. The best previous algorithm requires ..) time and . space.作者: 榨取 時間: 2025-3-27 12:01 作者: dialect 時間: 2025-3-27 16:20
Conference proceedings 1995e presents 27 selected refereed full research papers and two invited papers; it addresses all current aspects of CPM and its applications such as the design and analysis of algorithms for pattern matching problems in strings, graphs, and hypertexts, as well as in biological sequences and molecules.作者: subordinate 時間: 2025-3-27 19:53 作者: sultry 時間: 2025-3-28 00:14
978-3-540-60044-2Springer-Verlag Berlin Heidelberg 1995作者: 獨特性 時間: 2025-3-28 04:31
Faisal Tariq,Laurence S. Dooleytring. Edges are drawn between two bases that are paired in the secondary structure and these edges have traditionally been assumed to be noncrossing. The noncrossing base-pairing naturally leads to a tree-like representation of the secondary structure of RNA strings..In this paper, we address sever作者: ASSET 時間: 2025-3-28 07:13 作者: 人類的發(fā)源 時間: 2025-3-28 14:06 作者: Commonwealth 時間: 2025-3-28 17:39
https://doi.org/10.1007/978-981-13-1768-2 in . having weighted edit distance at most . from .: this is the approximate substring matching problem. We focus on the case in which . is fixed and preprocessed in linear time, while . and . vary over consecutive searches. We give an ..) time and . space algorithm, where . depends on the problem 作者: 跑過 時間: 2025-3-28 20:54 作者: GROVE 時間: 2025-3-29 00:08 作者: 危險 時間: 2025-3-29 05:10 作者: AMITY 時間: 2025-3-29 08:21 作者: fulcrum 時間: 2025-3-29 14:39
Bernd M. Buchholz,Zbigniew StyczynskiA sequences. . implements a branch-and-bound technique on a variant of Dijkstra‘s shortest paths algorithm to prune the basic dynamic programming graph. We have made substantial improvements in the time and space usage of .. On some runs, we achieve an order of magnitude reduction in space usage and作者: Ceremony 時間: 2025-3-29 15:55 作者: Keshan-disease 時間: 2025-3-29 22:53 作者: visual-cortex 時間: 2025-3-30 00:58
Smart Grids: Security and Privacy Issuesmum agreement subtree (MAST) problem for three trees with unbounded degree cannot be approximated within ratio .in polynomial time for any . < 1, unless NP .DTIME[2.], and MAST with edge contractions for two binary trees is NP-hard. This answers two open questions posed in [1]. For the maximum refin作者: 吹氣 時間: 2025-3-30 05:40 作者: rectum 時間: 2025-3-30 10:30 作者: 馬具 時間: 2025-3-30 13:27
Off-Grid Green Hydrogen Production Systemsotein structures. This report focuses on the identification and matching of common substructures, and treats two problems: the probing of a database of structures with a segment of a protein to identify regions from other proteins with conformations similar to that of the probe, and the determinatio作者: 使迷醉 時間: 2025-3-30 17:34
Off-Grid Green Hydrogen Production Systemsll. A brief survey on the biological macromolecules and their function is given. Sequence data analysis is introduced as a basic tool for the experimental bench biologist. So far, most queries for such analyses are issued on flat files and static indices. We discuss position tree structures and thei作者: Lignans 時間: 2025-3-30 22:49 作者: 改革運動 時間: 2025-3-31 04:01 作者: STEER 時間: 2025-3-31 08:01
Smart Grids: Security and Privacy IssuesThe suffix cactus is a new alternative to the suffix tree and the suffix array as an index of large static texts. Its size and its performance in searches lies between those of the suffix tree and the suffix array. Structurally, the suffix cactus can be seen either as a compact variation of the suffix tree or as an augmented suffix array.作者: dilute 時間: 2025-3-31 12:37
Common subsequences and supersequences and their expected length,Let . be the expected length of a longest common subsequence of . sequences of length . over an alphabet of size .. It is known that there are constants .. such that ..., we show that ..=..). Bounds for the corresponding constants for the expected length of a shortest common supersequence are also presented.作者: Duodenitis 時間: 2025-3-31 14:52 作者: 索賠 時間: 2025-3-31 20:57 作者: 充滿裝飾 時間: 2025-3-31 22:37
Combinatorial Pattern Matching978-3-540-49412-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
