Sciweavers

807 search results - page 59 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
15 years 10 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li
139
Voted
CPM
2006
Springer
125views Combinatorics» more  CPM 2006»
15 years 7 months ago
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
Tetsuo Shibuya
ICDE
2006
IEEE
110views Database» more  ICDE 2006»
16 years 5 months ago
Detecting Duplicates in Complex XML Data
Recent work both in the relational and the XML world have shown that the efficacy and efficiency of duplicate detection is enhanced by regarding relationships between entities. Ho...
Melanie Weis, Felix Naumann
BMCBI
2004
196views more  BMCBI 2004»
15 years 3 months ago
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
Background: In a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUS...
Robert C. Edgar
TSE
2010
123views more  TSE 2010»
14 years 10 months ago
Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking
Current stochastic model checkers do not make counterexamples for property violations readily available. In this paper we apply directed explicit state space search to discrete- a...
Husain Aljazzar, Stefan Leue