Sciweavers

316 search results - page 22 / 64
» A 3D pattern matching algorithm for DNA sequences
Sort
View
IWANN
2009
Springer
15 years 8 months ago
Efficient Exact Pattern-Matching in Proteomic Sequences
Abstract. This paper proposes a novel algorithm for complete exact patternmatching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficie...
Sérgio A. D. Deusdado, Paulo M. M. Carvalho
ICCV
2007
IEEE
16 years 3 months ago
Articulated Shape Matching by Robust Alignment of Embedded Representations
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...
RECOMB
2000
Springer
15 years 5 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
RECOMB
2010
Springer
15 years 8 months ago
A Novel Abundance-Based Algorithm for Binning Metagenomic Sequences Using l-Tuples
Abstract. Metagenomics is the study of microbial communities sampled directly from their natural environment, without prior culturing. Among the computational tools recently develo...
Yu-Wei Wu, Yuzhen Ye
RECOMB
2004
Springer
16 years 2 months ago
Finding approximate tandem repeats in genomic sequences
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
Ydo Wexler, Zohar Yakhini, Yechezkel Kashi, Dan Ge...