Sciweavers

440 search results - page 17 / 88
» Comparison of Galled Trees
Sort
View
RECOMB
2005
Springer
14 years 9 months ago
Stability of Rearrangement Measures in the Comparison of Genome Sequences
We present data-analytic and statistical tools for studying rates of rearrangement of whole genomes and to assess the stability of these methods with changes in the level of resol...
David Sankoff, Matthew Mazowita
ESEM
2007
ACM
14 years 19 days ago
Comparison of Outlier Detection Methods in Fault-proneness Models
In this paper, we experimentally evaluated the effect of outlier detection methods to improve the prediction performance of fault-proneness models. Detected outliers were removed ...
Shinsuke Matsumoto, Yasutaka Kamei, Akito Monden, ...
RECOMB
2000
Springer
14 years 9 days ago
A compression algorithm for DNA sequences and its applications in genome comparison
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
Xin Chen, Sam Kwong, Ming Li
APPINF
2003
13 years 10 months ago
A Comparison of Structure-generic Relational Storage Schemes of XML Data
XML data is often modeled as node-labeled trees. In a structure-generic relational storage scheme, the structure of the XML data is shredded into pieces of a generic type, such as...
Weining Zhang, Douglas Pollok
IJCAI
1989
13 years 10 months ago
An Empirical Comparison of Pattern Recognition, Neural Nets, and Machine Learning Classification Methods
Classification methods from statistical pattern recognition, neural nets, and machine learning were applied to four real-world data sets. Each of these data sets has been previous...
Sholom M. Weiss, Ioannis Kapouleas