Efficient algorithms for regular expression constrained sequence alignment

DOI10.1016/J.IPL.2007.04.007zbMATH Open1184.68596OpenAlexW2083319603MaRDI QIDQ2379980FDOQ2379980

Authors: Yun-Sheng Chung, Chin Lung Lu, Chuan Yi Tang 

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.007

Recommendations

• Efficient Algorithms for Regular Expression Constrained Sequence Alignment
• Practical regular expression constrained sequence alignment
• Regular expression constrained sequence alignment
• Combinatorial Pattern Matching
• Regular language constrained sequence alignment revisited

zbMATH Keywords

algorithmsdynamic programmingregular expressionconstrained sequence alignment

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A linear space algorithm for computing maximal common subsequences
• The constrained longest common subsequence problem
• A simple algorithm for the constrained sequence problems
• Combinatorial Pattern Matching

Cited In (10)

• Combinatorial Pattern Matching
• Algorithms for path-constrained sequence alignment
• Regular expression constrained sequence alignment
• SA-REPC -- sequence alignment with regular expression path constraint
• Regular language constrained sequence alignment revisited
• A fast algorithm for the constrained multiple sequence alignment problem
• Efficient Algorithms for Regular Expression Constrained Sequence Alignment
• An algorithm and applications to sequence alignment with weighted constraints
• Practical regular expression constrained sequence alignment
• Efficient sequence alignment with side-constraints by cluster tree elimination

Uses Software

• PROSITE
• MuSiC

This page was built for publication: Efficient algorithms for regular expression constrained sequence alignment

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