Sciweavers

1421 search results - page 165 / 285
» Algorithms for subsequence combinatorics
Sort
View
BMCBI
2007
162views more  BMCBI 2007»
15 years 6 months ago
Genome-wide identification of specific oligonucleotides using artificial neural network and computational genomic analysis
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
Chun-Chi Liu, Chin-Chung Lin, Ker-Chau Li, Wen-Shy...
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
15 years 12 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...
BMCBI
2008
128views more  BMCBI 2008»
15 years 6 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
ICCV
2009
IEEE
16 years 11 months ago
A Probabilistic Framework for Partial Intrinsic Symmetries in Geometric Data
In this paper, we present a novel algorithm for partial intrinsic symmetry detection in 3D geometry. Unlike previous work, our algorithm is based on a conceptually simple and st...
Ruxandra Lasowski, Art Tevs, Hans-Peter Seidel, Mi...
IPMI
2001
Springer
16 years 7 months ago
Feature Enhancement in Low Quality Images with Application to Echocardiography
In this paper we propose a novel approach to feature enhancement to enhance the quality of noisy images. Our approach is based on a phase-based feature detection algorithm, followe...
Djamal Boukerroui, J. Alison Noble, Michael Brady