scientific article; zbMATH DE number 2086217

MaRDI QIDQ3044314zbMATH OpenFDO

Authors Abdullah N. Arslan, Ömer Eğecioğlu

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2286/22860038.htm

Mathematics Subject Classification ID

Combinatorics on words (68R15) Approximation algorithms (68W25) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)

Recommendations

• APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS
• Efficient algorithms for local alignment search
• Computational and Information Science
• Algorithms for path-constrained sequence alignment
• On locally optimal alignments in genetic sequences
• Computing and Combinatorics
• Hardness of approximation for non-overlapping local alignments.
• Linear-space algorithms that build local alignments from fragments
• Global and local sequence alignment with a bounded number of gaps
• On the complexity of constrained sequences alignment problems

Cited in

(13)

• Hardness of approximation for non-overlapping local alignments.
• Tandem cyclic alignment
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• Dynamic programming based approximation algorithms for sequence alignment with constraints
• APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS
• scientific article; zbMATH DE number 1996311 (Why is no real title available?)
• scientific article; zbMATH DE number 1786451 (Why is no real title available?)
• Computing and Combinatorics
• An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
• Bounded-length Smith-Waterman alignment
• On locally optimal alignments in genetic sequences
• Local multiple alignment via subgraph enumeration
• Sparse normalized local alignment

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044314)