[图书][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
Detection of long non–coding RNA homology, a comparative study on alignment and alignment–free metrics
TMR Noviello, A Di Liddo, GM Ventola, A Spagnuolo… - BMC …, 2018 - Springer
Abstract Background Long non-coding RNAs (lncRNAs) represent a novel class of non-
coding RNAs having a crucial role in many biological processes. The identification of long …
coding RNAs having a crucial role in many biological processes. The identification of long …
[HTML][HTML] Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
We study two fundamental problems concerning the search for interesting regions in
sequences:(i) given a sequence of real numbers of length n and an upper bound U, find a …
sequences:(i) given a sequence of real numbers of length n and an upper bound U, find a …
Maximum-scoring segment sets
M Csuros - IEEE/ACM Transactions on Computational Biology …, 2004 - ieeexplore.ieee.org
We examine the problem of finding maximum-scoring sets of disjoint segments in a
sequence of scores. The problem arises in DNA and protein segmentation and in …
sequence of scores. The problem arises in DNA and protein segmentation and in …
Dynamic programming based approximation algorithms for sequence alignment with constraints
AN Arslan, Ö Eğecioğlu - INFORMS Journal on Computing, 2004 - pubsonline.informs.org
Given two sequences X and Y, the classical dynamic programming solution to the local
alignment problem searches for two subsequences I⊆ X and J⊆ Y with maximum similarity …
alignment problem searches for two subsequences I⊆ X and J⊆ Y with maximum similarity …
Approximation algorithms for local alignment with length constraints
AN Arslan, Ö Eğecioğlu - International Journal of Foundations of …, 2002 - World Scientific
The local sequence alignment problem is the detection of similar subsequences in two given
sequences of lengths n≥ m. Unfortunately the common notion of local alignment suffers …
sequences of lengths n≥ m. Unfortunately the common notion of local alignment suffers …
Algorithms for Local Alignment with Length Constraints*
AN Arslan, Ö Eğecioğlu - Latin American Symposium on Theoretical …, 2002 - Springer
The local sequence alignment problem is the detection of similar subsequences in two given
sequences of lengths n≥ m. Unfortunately the common notion of local alignment suffers …
sequences of lengths n≥ m. Unfortunately the common notion of local alignment suffers …
A pattern matching approach for the estimation of alignment between any two given DNA sequences
K Basu, N Sriraam, RJA Richard - Journal of Medical Systems, 2007 - Springer
For a given DNA sequence, it is well known that pair wise alignment schemes are used to
determine the similarity with the DNA sequences available in the databanks. The efficiency …
determine the similarity with the DNA sequences available in the databanks. The efficiency …