Application of max-plus algebra to biological sequence comparisons

DOI10.1016/S0304-3975(02)00237-2zbMath1025.68048MaRDI QIDQ1870593

Jean-Paul Comet

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingmax-plus algebrabiological sequence alignment

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Dynamic programming (90C39)

Related Items

Computation of the transient in max-plus linear systems via SMT-solving ⋮ Fast distance multiplication of unit-Monge matrices

Uses Software

• Agrep
• PSI-BLAST
• BLAST
• LASSAP

Cites Work

• Sequence comparison with concave weighting functions
• Comparison of biosequences
• Fast and practical approximate string matching
• Dioïds and semirings: Links to fuzzy sets and other applications
• A fast string searching algorithm
• Finding approximate patterns in strings
• On the Theory and Computation of Evolutionary Distances
• Fast Pattern Matching in Strings
• Algorithms for computing finite semigroups
• Performance evaluation of (max,+) automata
• Boyer-Moore approach to approximate string matching
• Unnamed Item