Finding similar regions in many sequences
From MaRDI portal
Publication:1869936
DOI10.1006/jcss.2002.1823zbMath1020.68040OpenAlexW2053743126MaRDI QIDQ1869936
Publication date: 4 May 2003
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.2002.1823
Related Items (17)
Consensus Patterns (Probably) Has no EPTAS ⋮ On the longest common rigid subsequence problem ⋮ A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences ⋮ On approximating string selection problems with outliers ⋮ Hardness and approximation of multiple sequence alignment with column score ⋮ Unnamed Item ⋮ Tight Hardness Results for Consensus Problems on Circular Strings and Time Series ⋮ Motif discovery using an immune genetic algorithm ⋮ An upper bound on the hardness of exact matrix based motif discovery ⋮ A cost-aggregating integer linear program for motif finding ⋮ On the kernelization complexity of string problems ⋮ Anonymizing binary and small tables is hard to approximate ⋮ On the complexity of finding gapped motifs ⋮ Consensus strings with small maximum distance and small distance sum ⋮ On the approximability of the maximum agreement subtree and maximum compatible tree problems ⋮ Hardness results for the center and median string problems under the weighted and unweighted edit distances ⋮ Computing a consensus trajectory in a vehicular network
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Line geometries for sequence comparisons
- Pattern recognition in several sequences: Consensus and alignment
- Efficient methods for multiple sequence alignment with guaranteed error bounds
- On the closest string and substring problems
- Multiple Alignment, Communication Cost, and Graph Matching
- Algorithms on Strings, Trees and Sequences
This page was built for publication: Finding similar regions in many sequences
