Sciweavers

Share
93 search results - page 1 / 19
» Quadratic Time Algorithms for Finding Common Intervals in Tw...
Sort
View
CPM
2004
Springer
108views Combinatorics» more  CPM 2004»
10 years 13 days ago
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
Thomas Schmidt, Jens Stoye
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
9 years 11 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
JCB
2007
108views more  JCB 2007»
9 years 7 months ago
A Dynamic Programming Approach for Finding Common Patterns in RNAs
We developed a dynamic programming approach of computing common sequence structure patterns among two RNAs given their primary sequences and their secondary structures. Common pat...
Sven Siebert, Rolf Backofen
APBC
2004
108views Bioinformatics» more  APBC 2004»
9 years 8 months ago
Ladderlike Stepping and Interval Jumping Searching Algorithms for DNA Sequences
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...
Tun-Wen Pai, Margaret Dah-Tsyr Chang, Jia-Han Chu,...
BMCBI
2006
100views more  BMCBI 2006»
9 years 7 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
books