作者: 蓋他為秘密 時間: 2025-3-21 21:07 作者: municipality 時間: 2025-3-22 02:42 作者: 儲備 時間: 2025-3-22 06:45 作者: 價值在貶值 時間: 2025-3-22 09:22 作者: Canary 時間: 2025-3-22 14:54
Smart Computing and Communication costs open new directions and opportunities in the study of complex genetic disease such as cancer or Alzheimer’s disease. The datasets collected for these studies are DNA sequences, with some noise and ambiguous information..In this talk I will discuss some of the algorithmic issues of disambiguat作者: Canary 時間: 2025-3-22 21:02
Haibo Luo,Zhiqiang Ruan,Fanyong Chenence sets in a large corpus. Our algorithm involves three steps: morphological similarity detection, contextual similarity analysis, and clustering. Finally, we present experimental results on over large corpus of real news text to analyze the performance our techniques.作者: 尖叫 時間: 2025-3-22 21:46
Laizhong Cui,Yanli Luo,Genghui Li,Nan Luerted lists stored in sorted arrays and use variants of binary search. We show that a succinct representation of the binary relation permits much better results, while using space within a lower order term of the optimal. We apply our results not only to conjunctive queries on binary relations, but 作者: bioavailability 時間: 2025-3-23 02:39
Xin Ren,Jiong Zhang,Ying Li,Jianwei Niuefficiently. We present a direct algorithm for the general RMQ-problem with linear preprocessing time and constant query time, without making use of any dynamic data structure. It consumes less than half of the space that is needed by the method by Berkman and Vishkin. We use our new algorithm for R作者: POINT 時間: 2025-3-23 06:51 作者: 虛弱 時間: 2025-3-23 11:25
Smart Computing and CommunicationSparse suffix trees are kind of suffix trees that represent only a subset of suffixes of the input string. In this paper we study ., which are one variation of sparse suffix trees. Let . be a dictionary of words and . be a string in .., namely, . is a sequence .. ?.. of . words in .. The word suffix作者: 星星 時間: 2025-3-23 14:43
Chengjun Yang,Ling zhou,Ce Yang. The suffix tree is an important indexing structure that provides optimal algorithms for memory bound data. However, string B-trees provide the best known asymptotic performance in external memory for substring search and update operations. Work on external memory variants of suffix trees has large作者: deficiency 時間: 2025-3-23 19:14
Xin Zhang,Yuwen Guo,Tao Wen,Hong Guor such 3-D structures are highly desired for research on proteins. This paper proposes a new data structure for indexing protein 3-D structures. For strings, there are many efficient indexing structures such as suffix trees, but it has been considered very difficult to design such sophisticated data作者: Oration 時間: 2025-3-24 00:05
Haibiao Liu,Zhihui Lai,Yudong Chen motif is derived from these samples and evaluated on all sequences. This approach works extremely well in practice, and is implemented by several programs. Li, Ma and Wang have shown that a simple algorithm of this sort is a polynomial-time approximation scheme. However, in 2005, we showed specific作者: APEX 時間: 2025-3-24 02:36 作者: flutter 時間: 2025-3-24 09:18 作者: 生來 時間: 2025-3-24 14:20 作者: JECT 時間: 2025-3-24 16:30
Smart Connected World: A Broader Perspectives are formalized here in a new mathematical model, called . (RAPT). We show that, under RAPT, the evolutionary process — including both the tree-topology as well as internal node genome orders — is . determined, a property that is of major significance both in theory and in practice. Furthermore, th作者: 笨拙的我 時間: 2025-3-24 23:03 作者: 等待 時間: 2025-3-25 02:37 作者: 軟弱 時間: 2025-3-25 05:47 作者: semble 時間: 2025-3-25 08:11
Technische Grundlagen und Begriffe, the text part satisfies some property..It is straightforward to do sequential matching in a text with properties. However, indexing in a text with properties becomes difficult if we desire the time to be output dependent. We present an algorithm for indexing a text with properties in .(.log|Σ|+. lo作者: PAN 時間: 2025-3-25 12:20
Technische Grundlagen und Begriffe,ern matching. One of the problems is that of ., finding all appearances of a pattern, proportionally enlarged according to an . scale, in a given text..The best known algorithm for this problem uses techniques from dictionary matching to solve the problem in .(..+... log.) time using .(..+..) space,作者: intoxicate 時間: 2025-3-25 18:23 作者: FUSC 時間: 2025-3-25 22:01
0302-9743 Overview: 978-3-540-35455-0978-3-540-35461-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: generic 時間: 2025-3-26 04:00 作者: GEN 時間: 2025-3-26 06:56 作者: collagen 時間: 2025-3-26 11:38 作者: SYN 時間: 2025-3-26 13:39
Smart Connected World: A Broader Perspectiveogy as well as internal node genome orders — is . determined, a property that is of major significance both in theory and in practice. Furthermore, the repeats are employed to provide linear-time algorithms for reconstructing both the genomic orders and the phylogeny, which are NP-hard problems under the classical model of . (SBR).作者: interrogate 時間: 2025-3-26 19:13 作者: 圓桶 時間: 2025-3-26 21:50 作者: 使混合 時間: 2025-3-27 05:02
On the Repeat-Annotated Phylogenetic Tree Reconstruction Problemogy as well as internal node genome orders — is . determined, a property that is of major significance both in theory and in practice. Furthermore, the repeats are employed to provide linear-time algorithms for reconstructing both the genomic orders and the phylogeny, which are NP-hard problems under the classical model of . (SBR).作者: arthrodesis 時間: 2025-3-27 05:20 作者: scoliosis 時間: 2025-3-27 12:00
An Improved Algorithm for the Macro-evolutionary Phylogeny Problemhe maximum number of copies of the gene in a species. In this paper, we propose an improved algorithm with time complexity of .(.) for solving this problem. We also show, that the problem can be solved in .(.) if unit costs are considered for both loss and duplication.作者: 食道 時間: 2025-3-27 16:38
Smart Computing and Communicationproblems in the field, such as genotype phasing, tag SNP selection (e.g. feature selection), and population stratification issues (e.g. clustering)..The talk will be self contained, although some introductory material for the biological terminology and the HapMap project can be found at http://www.hapmap.org/whatishapmap.html.作者: 未開化 時間: 2025-3-27 18:43
Xin Ren,Jiong Zhang,Ying Li,Jianwei Niuant applications, e.g., in computational biology. Experimental studies show that our new method is almost twice as fast in practice as previous approaches, and asymptotically slower variants of the constant-time algorithms perform even better for today’s common problem sizes.作者: remission 時間: 2025-3-27 22:43
Faguo Zhou,Jing Zhang,Yanan Songl has a time complexity linear in .. In particular, we give an .(.)-space index that supports .-error matching in .(. + . + (log.). loglog.) worst-case time. Furthermore, the index can be compressed from .(.) words into .(.) bits with a slight increase in the time complexity.作者: –DOX 時間: 2025-3-28 04:22
Smart Computing and Informaticste the hardness of these restricted versions of the problem, we show that the general clustering problem on an unbounded number of missing values such that they occur for every fixed position of an input vector in at most one fingerprint is polynomial time solvable.作者: prostatitis 時間: 2025-3-28 07:03 作者: seruting 時間: 2025-3-28 10:41
SNP and Haplotype Analysis – Algorithms and Applicationsproblems in the field, such as genotype phasing, tag SNP selection (e.g. feature selection), and population stratification issues (e.g. clustering)..The talk will be self contained, although some introductory material for the biological terminology and the HapMap project can be found at http://www.hapmap.org/whatishapmap.html.作者: defeatist 時間: 2025-3-28 16:28 作者: Judicious 時間: 2025-3-28 20:42 作者: 業(yè)余愛好者 時間: 2025-3-29 02:55
Fingerprint Clustering with Bounded Number of Missing Valueste the hardness of these restricted versions of the problem, we show that the general clustering problem on an unbounded number of missing values such that they occur for every fixed position of an input vector in at most one fingerprint is polynomial time solvable.作者: 糾纏,纏繞 時間: 2025-3-29 05:43 作者: Musket 時間: 2025-3-29 11:15 作者: IOTA 時間: 2025-3-29 12:50
Haibiao Liu,Zhihui Lai,Yudong Chenthat, for a variety of different definitions of “strong” binary motifs, the approximation ratio of sample-based algorithms converges to one exponentially fast in .. We also describe “very strong” motifs, for which the simple sample-based approach always identifies the correct motif, even for modest values of ..作者: 疲憊的老馬 時間: 2025-3-29 15:46
Chirag Arora,Shyam S. Pattnaik,R. N. Baraltilable segment is {0, ..., .} as tiles whose smallest tilable segment is {0, ..., .}, for all strict divisors . of .. This enables us to exhibit an optimal linear time algorithm to compute for a given pattern the smallest segment that it tiles if any, as well as a recurrence formula for counting the tiles of a segment.作者: 洞察力 時間: 2025-3-29 21:17 作者: 善變 時間: 2025-3-30 00:26 作者: constitute 時間: 2025-3-30 06:42 作者: Infraction 時間: 2025-3-30 11:22 作者: Grating 時間: 2025-3-30 15:13
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degret lower bound: while MAST can be solved in .(..) time where . denotes the input length, we show that an .(..) bound is not achievable, unless SNP ? SE. We also show that MCT is W[1]-hard with respect to ., and that MCT cannot be solved in . time, unless SNP ? SE.作者: 步兵 時間: 2025-3-30 17:34
Role of Semantics in Smart City Applicationsv models. We present generalizations of the methods to compute the probability of finding a word of length . shared among . of . sequences, and to allow mismatches. We show through simulations that our approximations are significantly more accurate than methods previously published.作者: BIPED 時間: 2025-3-30 23:30
Cyber-Physical-Social Systems: An Overviewhe maximum number of copies of the gene in a species. In this paper, we propose an improved algorithm with time complexity of .(.) for solving this problem. We also show, that the problem can be solved in .(.) if unit costs are considered for both loss and duplication.作者: 嘮叨 時間: 2025-3-31 04:00
Asynchronous Pattern Matchingpossibility of errors in the data .. We present motivation from text editing, computational biology, and computer architecture, that points to a new paradigm – where the errors occur in the .. It turns out that there are differences in techniques, complexities, and tools between the two different mo作者: 無能的人 時間: 2025-3-31 05:53
SNP and Haplotype Analysis – Algorithms and Applications costs open new directions and opportunities in the study of complex genetic disease such as cancer or Alzheimer’s disease. The datasets collected for these studies are DNA sequences, with some noise and ambiguous information..In this talk I will discuss some of the algorithmic issues of disambiguat作者: Desert 時間: 2025-3-31 09:12
Identifying Co-referential Names Across Large Corporaence sets in a large corpus. Our algorithm involves three steps: morphological similarity detection, contextual similarity analysis, and clustering. Finally, we present experimental results on over large corpus of real news text to analyze the performance our techniques.作者: 孤獨(dú)無助 時間: 2025-3-31 13:24
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documentserted lists stored in sorted arrays and use variants of binary search. We show that a succinct representation of the binary relation permits much better results, while using space within a lower order term of the optimal. We apply our results not only to conjunctive queries on binary relations, but 作者: 脖子 時間: 2025-3-31 18:16 作者: strdulate 時間: 2025-3-31 23:14 作者: Acquired 時間: 2025-4-1 04:15
On-Line Linear-Time Construction of Word Suffix TreesSparse suffix trees are kind of suffix trees that represent only a subset of suffixes of the input string. In this paper we study ., which are one variation of sparse suffix trees. Let . be a dictionary of words and . be a string in .., namely, . is a sequence .. ?.. of . words in .. The word suffix作者: Longitude 時間: 2025-4-1 06:32
Obtaining Provably Good Performance from Suffix Trees in Secondary Storage. The suffix tree is an important indexing structure that provides optimal algorithms for memory bound data. However, string B-trees provide the best known asymptotic performance in external memory for substring search and update operations. Work on external memory variants of suffix trees has large作者: 不溶解 時間: 2025-4-1 10:52
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structuresr such 3-D structures are highly desired for research on proteins. This paper proposes a new data structure for indexing protein 3-D structures. For strings, there are many efficient indexing structures such as suffix trees, but it has been considered very difficult to design such sophisticated data作者: 沒有希望 時間: 2025-4-1 16:15 作者: 皮薩 時間: 2025-4-1 21:06
