作者: Project 時間: 2025-3-21 22:47
978-3-540-67633-1Springer-Verlag Berlin Heidelberg 2000作者: Heart-Attack 時間: 2025-3-22 02:19 作者: 是比賽 時間: 2025-3-22 05:15
Parametric Multiple Sequence Alignment and Phylogeny Constructione given or inferred. It is shown that many of the usual formulations of these problems fall within the same integer parametric framework, implying that the number of distinct optima obtained as the parameters are varied across their ranges is polynomially bounded in the length and number of sequences.作者: 秘方藥 時間: 2025-3-22 12:37
Improving Static Compression Schemes by Alphabet Extensionich a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.作者: Insul島 時間: 2025-3-22 14:42 作者: Insul島 時間: 2025-3-22 18:42
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/230008.jpg作者: 微粒 時間: 2025-3-22 21:33 作者: 冒煙 時間: 2025-3-23 01:32 作者: 訓(xùn)誡 時間: 2025-3-23 07:27
https://doi.org/10.1007/978-3-642-02368-2me collections and showing how they are organized. Then we look to the future. Although present digital libraries are quite like conventional libraries, we argue that future ones will feel qualitatively different. Readers—and writers—will work in the library using a kind of context-directed browsing作者: stroke 時間: 2025-3-23 10:54 作者: vitreous-humor 時間: 2025-3-23 15:01 作者: 粗糙濫制 時間: 2025-3-23 21:15
Smart Industry & Smart Educationhich the search space is evaluated. Ambiguity, unless explicitly considered, leads to unnecessarily complicated, inflexible, and sometimes even incorrect dynamic programming algorithms. Building upon the recently developed algebraic approach to dynamic programming, we formalize the notions of ambigu作者: Pander 時間: 2025-3-24 01:47
Smart Industry & Smart Education. and ., find a solution to the edit distance between . and . where . (incremental) or ?decremental). As a solution for the edit distance between . and ., we define the difference representation of the D-table, which leads to a simple and intuitive algorithm for the incremental/decremental edit dist作者: 咯咯笑 時間: 2025-3-24 03:26 作者: Lymphocyte 時間: 2025-3-24 08:09
Information Aggregation in an Enterprisethe first program to exploit the fact that the motif alignment problem is easier for short motifs. Indeed for a fixed motif width the running time of the algorithm is asymptotically linear in the size of the input. We tested the performance of the program on a dataset of 300 E. . promoter sequences.作者: 外形 時間: 2025-3-24 12:33 作者: 感情 時間: 2025-3-24 15:59 作者: 價值在貶值 時間: 2025-3-24 20:59
Gamification of Workplace Activities is used to compare phylogenies. More precisely . allows to provide a subset of the species such that the exact distances between species in such subset is preserved among all evolutionary trees considered. In this paper, the approximation complexity of the . problem is investigated, showing that it作者: Harbor 時間: 2025-3-24 23:38 作者: 長處 時間: 2025-3-25 05:33 作者: Junction 時間: 2025-3-25 08:31 作者: Wordlist 時間: 2025-3-25 15:34
Furqan Alam,Rashid Mehmood,Iyad Katibich text characters to inspect, we can still use the characters explicitly represented in those formats to shift the pattern in the text. We present a basic approach and more advanced ones. Despite that the theoretical average complexity does not improve because still all the symbols in the compress作者: expdient 時間: 2025-3-25 19:32
Rashid Mehmood,Simon See,Imrich Chlamtacat captures various dictionary-based compression methods. For a subclass of collage systems that contain no truncation, our new algorithm runs in O(‖D‖ + . + m. + .) time using O(‖D‖ + m.) space, where ‖D‖ is the size of dictionary . is the compressed text length, . is the pattern length, and . is t作者: VERT 時間: 2025-3-25 21:09
Shoayee Alotaibi,Rashid Mehmood,Iyad Katibcifically the LZ78 and LZW variants. Given a text of length . compressed into length n, and a pattern of length ., we report all the . occurrences of the pattern in the text allowing up to insertions, deletions and substitutions, in . time. The existence problem needs . time. We also show that the a作者: fructose 時間: 2025-3-26 01:14 作者: Relinquish 時間: 2025-3-26 07:13
Combinatorial Pattern Matching978-3-540-45123-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: malapropism 時間: 2025-3-26 10:51 作者: 故意釣到白楊 時間: 2025-3-26 15:01
Smart Industry & Smart Education. and ., find a solution to the edit distance between . and . where . (incremental) or ?decremental). As a solution for the edit distance between . and ., we define the difference representation of the D-table, which leads to a simple and intuitive algorithm for the incremental/decremental edit distance problem.作者: 反饋 時間: 2025-3-26 19:03 作者: GRATE 時間: 2025-3-27 00:19
Bdoor Alsolami,Rashid Mehmood,Aiiad Albeshriich a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.作者: COST 時間: 2025-3-27 03:27
https://doi.org/10.1007/978-3-642-02368-2 machine-learning techniques have achieved remarkable successes in tasks such as document classification, part-of-speech tagging, named-entity recognition and classification, and even parsing and machine translation.作者: 真繁榮 時間: 2025-3-27 05:26
Smart Industry & Smart Educationa master copy of recurrences, that can solve all DP problems in a well-defined domain. We demonstrate the advantages of such a systematic approach using problems from the areas of RNA folding and pairwise sequence comparison.作者: Hearten 時間: 2025-3-27 13:25 作者: expansive 時間: 2025-3-27 14:32 作者: leniency 時間: 2025-3-27 21:12
Machine Learning for Efficient Natural-Language Processing machine-learning techniques have achieved remarkable successes in tasks such as document classification, part-of-speech tagging, named-entity recognition and classification, and even parsing and machine translation.作者: 匍匐 時間: 2025-3-28 01:35
Explaining and Controlling Ambiguity in Dynamic Programminga master copy of recurrences, that can solve all DP problems in a well-defined domain. We demonstrate the advantages of such a systematic approach using problems from the areas of RNA folding and pairwise sequence comparison.作者: amphibian 時間: 2025-3-28 03:46 作者: 描述 時間: 2025-3-28 07:12 作者: milligram 時間: 2025-3-28 11:35 作者: mastopexy 時間: 2025-3-28 17:13 作者: Anterior 時間: 2025-3-28 20:06
Luciana V. Castilho,Heitor S. Lopeser arc-annotated sequences with various arc structures and present some new algorithmic and complexity results on the longest arc-preserving common subsequence problem. Some of our results answer an open question in [[.],[.]] and some others improve the hardness results in [[.],[.]].作者: anarchist 時間: 2025-3-29 02:26 作者: 清澈 時間: 2025-3-29 06:28 作者: AVID 時間: 2025-3-29 07:15
A Faster and Unifying Algorithm for Comparing Trees their nodes labeled by the same symbol) and evolutionary trees (i.e., leaf-labeled trees with distinct symbols for distinct leaves). This paper presents an algorithm for comparing trees that are labeled in an arbitrary manner. In addition to the generalization, our algorithm is faster than the previous algorithms in many cases.作者: CULP 時間: 2025-3-29 14:15
The Longest Common Subsequence Problem for Arc-Annotated Sequenceser arc-annotated sequences with various arc structures and present some new algorithmic and complexity results on the longest arc-preserving common subsequence problem. Some of our results answer an open question in [[.],[.]] and some others improve the hardness results in [[.],[.]].作者: Landlocked 時間: 2025-3-29 19:01
Approximate String Matching over Ziv—Lempel Compressed Textthe pattern in the text allowing up to insertions, deletions and substitutions, in . time. The existence problem needs . time. We also show that the algorithm can be adapted to run in ... + min(..(mσ). + .) average time, where σ is the alphabet size. The experimental results show a speedup over the basic approach for moderate . and small . 作者: DNR215 時間: 2025-3-29 22:14 作者: CAGE 時間: 2025-3-30 03:15 作者: 裹住 時間: 2025-3-30 05:32 作者: lattice 時間: 2025-3-30 08:12
Furqan Alam,Rashid Mehmood,Iyad Katibed text have to be scanned, we show experimentally that speedups of up to 30% over the fastest previous approaches are obtained. Moreover, we show that using an encoding method that sacrifices some compression ratio our method is twice as fast as decompressing plus searching using the best available algorithms.作者: 柏樹 時間: 2025-3-30 15:43
Browsing around a Digital Library: Today and Tomorrow. This will be supported by structures derived from automatic analysis of the contents of the library—not just the catalog, or abstracts, but the full text of the books and journals—using new techniques of text mining.作者: 冷漠 時間: 2025-3-30 16:55 作者: 過去分詞 時間: 2025-3-31 00:32
Approximating the Maximum Isomorphic Agreement Subtree Is Hard cannot be approximated in polynomial time within factor log.. for any . > 0 unless . ? .(2.) for instances containing three trees. Moreover, we show that such result can be strengthened whenever instances of the . problem can contain an arbitrary number of trees, since . shares the same approximation lower bound of ..作者: 難解 時間: 2025-3-31 02:31
Boyer—Moore String Matching over Ziv-Lempel Compressed Texted text have to be scanned, we show experimentally that speedups of up to 30% over the fastest previous approaches are obtained. Moreover, we show that using an encoding method that sacrifices some compression ratio our method is twice as fast as decompressing plus searching using the best available algorithms.作者: 的事物 時間: 2025-3-31 07:35 作者: tympanometry 時間: 2025-3-31 11:02 作者: Anguish 時間: 2025-3-31 17:08 作者: 花費 時間: 2025-3-31 19:27
Algorithmic Aspects of Speech Recognition: A Synopsis Since many of the problems arising in speech recognition are well suited for algorithmic studies, we present them in terms familiar to algorithm designers. Such cross fertilization can breed fresh insights from new perspectives..This material is abstracted from A. L. Buchsbaum and R. Giancarlo, ., 作者: Cerumen 時間: 2025-3-31 22:03 作者: Pandemic 時間: 2025-4-1 03:38
