Sciweavers

362 search results - page 19 / 73
» Finding Motifs with Gaps
Sort
View
BMCBI
2006
137views more  BMCBI 2006»
13 years 8 months ago
Sigma: multiple alignment of weakly-conserved non-coding DNA sequence
Background: Existing tools for multiple-sequence alignment focus on aligning protein sequence or protein-coding DNA sequence, and are often based on extensions to Needleman-Wunsch...
Rahul Siddharthan
BMCBI
2005
125views more  BMCBI 2005»
13 years 8 months ago
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous ver...
Amarendran R. Subramanian, Jan Weyer-Menkhoff, Mic...
IEICET
2006
55views more  IEICET 2006»
13 years 8 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
CIBCB
2005
IEEE
14 years 2 months ago
Network Motifs, Feedback Loops and the Dynamics of Genetic Regulatory Networks
We analyse a suite of Boolean networks which have been evolved to exhibit limit cycle-type dynamics in terms of the distribution of small network motifs and feedback loops. We find...
Jennifer Hallinan, Paul T. Jackway
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
13 years 6 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo