161 search results - page 7 / 33 » Efficient Algorithms for Handling Molecular Weighted Sequenc... |
IJFCS
2006
14 years 11 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
99
Voted
IJCGA
2008
14 years 11 months ago
2008
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
BMCBI
2008
14 years 11 months ago
2008
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
ALMOB
2008
14 years 11 months ago
2008
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
BIRD
2007
Springer
15 years 5 months ago
2007
Springer
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...