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...
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...
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...
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...
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 ...