Sciweavers

685 search results - page 10 / 137
» Succinct Trees in Practice
Sort
View
CPM
2005
Springer
109views Combinatorics» more  CPM 2005»
14 years 1 months ago
Using PQ Trees for Comparative Genomics
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
Gad M. Landau, Laxmi Parida, Oren Weimann
ACL
2006
13 years 9 months ago
Efficient Sentence Retrieval Based on Syntactic Structure
This paper proposes an efficient method of sentence retrieval based on syntactic structure. Collins proposed Tree Kernel to calculate structural similarity. However, structual ret...
Hiroshi Ichikawa, Keita Hakoda, Taiichi Hashimoto,...
FLAIRS
2001
13 years 9 months ago
A Practical Markov Chain Monte Carlo Approach to Decision Problems
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
Timothy Huang, Yuriy Nevmyvaka
SRDS
1998
IEEE
13 years 11 months ago
Practical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
Frank K. H. A. Dehne, Silvia Götz
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
13 years 5 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro