Sciweavers

447 search results - page 23 / 90
» Performance Analysis of Sequence Alignment Applications
Sort
View
BMCBI
2011
13 years 22 days ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
PAM
2012
Springer
12 years 4 months ago
A Sequence-Oriented Stream Warehouse Paradigm for Network Monitoring Applications
Network administrators are faced with the increasingly challenging task of monitoring their network’s health in real time, drawing upon diverse and voluminous measurement data fe...
Lukasz Golab, Theodore Johnson, Subhabrata Sen, Je...
BMCBI
2011
13 years 4 months ago
PICS-Ord: Unlimited Coding of Ambiguous Regions by Pairwise Identity and Cost Scores Ordination
Background: We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by ‘Pairwise Identity and Cost Scores Ordination’ (PICS-Ord)....
Robert K. Luecking, Brendan P. Hodkinson, Alexandr...
SPIRE
2005
Springer
14 years 2 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
LION
2009
Springer
114views Optimization» more  LION 2009»
14 years 3 months ago
Substitution Matrices and Mutual Information Approaches to Modeling Evolution
Abstract. Substitution matrices are at the heart of Bioinformatics: sequence alignment, database search, phylogenetic inference, protein family classication are based on Blosum, P...
Stephan Kitchovitch, Yuedong Song, Richard C. van ...