Sciweavers

2597 search results - page 66 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
15 years 5 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
IPL
2008
95views more  IPL 2008»
15 years 1 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...
NAR
2008
152views more  NAR 2008»
15 years 1 months ago
PROMALS3D web server for accurate multiple protein sequence and structure alignments
Multiple sequence alignments are essential in computational sequence and structural analysis, with applications in homology detection, structure modeling, function prediction and ...
Jimin Pei, Ming Tang, Nick V. Grishin
BMCBI
2005
150views more  BMCBI 2005»
15 years 1 months ago
Approaching the taxonomic affiliation of unidentified sequences in public databases - an example from the mycorrhizal fungi
Background: During the last few years, DNA sequence analysis has become one of the primary means of taxonomic identification of species, particularly so for species that are minut...
R. Henrik Nilsson, Erik Kristiansson, Martin Ryber...
BMCBI
2004
125views more  BMCBI 2004»
15 years 1 months ago
A fast algorithm for determining the best combination of local alignments to a query sequence
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
Gavin C. Conant, Andreas Wagner