Efficient algorithms for regular expression constrained sequence alignment (Q2379980): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Combinatorial Pattern Matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple algorithm for the constrained sequence problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear space algorithm for computing maximal common subsequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4506483 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The constrained longest common subsequence problem / rank | |||
Normal rank | |||
Latest revision as of 15:24, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for regular expression constrained sequence alignment |
scientific article |
Statements
Efficient algorithms for regular expression constrained sequence alignment (English)
0 references
24 March 2010
0 references
constrained sequence alignment
0 references
algorithms
0 references
regular expression
0 references
dynamic programming
0 references
