Sciweavers

2403 search results - page 219 / 481
» Similarity of Event Sequences
Sort
View
TALG
2008
131views more  TALG 2008»
15 years 22 days ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
118
Voted
BIBM
2007
IEEE
133views Bioinformatics» more  BIBM 2007»
15 years 1 months ago
Mining Clinical Data with a Temporal Dimension: A Case Study
Clinical databases store large amounts of information about patients and their medical conditions. Data mining techniques can extract relationships and patterns holding in this we...
Michele Berlingerio, Francesco Bonchi, Fosca Giann...
BMCBI
2006
192views more  BMCBI 2006»
15 years 26 days ago
Analysis of circular genome rearrangement by fusions, fissions and block-interchanges
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
Chin Lung Lu, Yen-Lin Huang, Tsui Ching Wang, Hsie...
116
Voted
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 6 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
89
Voted
BMCBI
2007
117views more  BMCBI 2007»
15 years 28 days ago
DNA-based watermarks using the DNA-Crypt algorithm
Background: The aim of this paper is to demonstrate the application of watermarks based on DNA sequences to identify the unauthorized use of genetically modified organisms (GMOs) ...
Dominik Heider, Angelika Barnekow