Sciweavers

316 search results - page 53 / 64
» A 3D pattern matching algorithm for DNA sequences
Sort
View
TCS
2008
14 years 11 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
BIOCOMP
2008
15 years 1 months ago
Analysis of Protein-Ligand Interactions Using Localized Stereochemical Features
Computational analyses of protein structure-function relationships have traditionally been based on sequence homology, fold family analysis and 3D motifs/templates. Previous struct...
Reetal Pai, James C. Sacchettini, Thomas R. Ioerge...
BMCBI
2008
179views more  BMCBI 2008»
14 years 11 months ago
Bayesian modeling of recombination events in bacterial populations
Background: We consider the discovery of recombinant segments jointly with their origins within multilocus DNA sequences from bacteria representing heterogeneous populations of fa...
Pekka Marttinen, Adam Baldwin, William P. Hanage, ...
BMCBI
2006
103views more  BMCBI 2006»
14 years 11 months ago
Cis-motifs upstream of the transcription and translation initiation sites are effectively revealed by their positional disequili
Background: The discovery of cis-regulatory motifs still remains a challenging task even though the number of sequenced genomes is constantly growing. Computational analyses using...
Kenneth W. Berendzen, Kurt Stüber, Klaus Hart...
LATA
2010
Springer
15 years 4 months ago
A Randomized Numerical Aligner (rNA)
With the advent of new sequencing technologies able to produce an enormous quantity of short genomic sequences, new tools able to search for them inside a references sequence genom...
Alberto Policriti, Alexandru I. Tomescu, Francesco...