Sciweavers

807 search results - page 38 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
IKE
2003
15 years 5 months ago
A Tree-Based inverted File for Fast Ranked-Document Retrieval
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
Wann-Yun Shieh, Tien-Fu Chen, Chung-Ping Chung
IJFCS
2006
108views more  IJFCS 2006»
15 years 4 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
15 years 5 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
15 years 11 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
IPPS
2009
IEEE
15 years 10 months ago
Dynamic parallelization for RNA structure comparison
In this paper we describe the parallelization of a dynamic programming algorithm used to find common RNA secondary structures including pseudoknots and similar structures. The se...
Eric Snow, Eric Aubanel, Patricia Evans