Sciweavers

2877 search results - page 203 / 576
» Computational Biology
Sort
View
127
Voted
RECOMB
2004
Springer
16 years 5 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
RECOMB
2003
Springer
16 years 5 months ago
Towards optimally multiplexed applications of universal DNA tag systems
We study a design and optimization problem that occurs, for example, when single nucleotide polymorphisms (SNPs) are to be genotyped using a universal DNA tag array. The problem o...
Amir Ben-Dor, Tzvika Hartman, Benno Schwikowski, R...
133
Voted
RECOMB
2003
Springer
16 years 5 months ago
Approximation of protein structure for fast similarity measures
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
Fabian Schwarzer, Itay Lotan
RECOMB
2002
Springer
16 years 5 months ago
Significance Of inter-species matches when evolutionary rate varies
We develop techniques to estimate the statistical significance of gap-free alignments between two genomic DNA sequences, using human-mouse alignments as an example. The sequences ...
Jia Li, Webb Miller
RECOMB
2001
Springer
16 years 5 months ago
Fast recovery of evolutionary trees with thousands of nodes
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
Miklós Csürös