scientific article; zbMATH DE number 1746434

MaRDI QIDQ4532058zbMATH OpenFDO

Authors S. Abdeddaim, B. Morgenstern

Publication date 28 May 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2066/20660001

zbMATH Keywords

consistencygreedy algorithmmultiple sequence alignmentconsistent equivalence relationpartial alignment

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Software, source code, etc. for problems pertaining to biology (92-04) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Consistency of optimal sequence alignments
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• A non-local gap-penalty for profile alignment
• scientific article; zbMATH DE number 434724
• Local multiple alignment via subgraph enumeration

Cited in

(3)

• A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
• DIALIGN
• GABIOS-LIB

Describes a project that uses

Uses Software

• Balibase
• ClustalW
• DbClustal

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 Q4532058)