The following pages link to Manal Mohamed (Q507404):
Displaying 20 items.
- Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Linear-time superbubble identification algorithm for genome assembly (Q897907) (← links)
- Optimal computation of avoided words (Q1708407) (← links)
- Internal dictionary matching (Q2037109) (← links)
- On overabundant words and their application to biological sequence analysis (Q2326388) (← links)
- Longest repeats with a block of \(k\) don't cares (Q2508981) (← links)
- Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis (Q2803803) (← links)
- Validation and Decomposition of Partially Occluded Images (Q3085982) (← links)
- (Q3565933) (← links)
- Finding Patterns with Variable Length Gaps or Don’t Cares (Q3591351) (← links)
- (Q4454548) (← links)
- On-Line Analysis And Validation Of Partially Occluded Images: Implementation And Practice (Q4792960) (← links)
- NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES (Q4907692) (← links)
- (Q5091065) (← links)
- Optimal Computation of Overabundant Words (Q5111793) (← links)
- (Q5446124) (← links)
- (Q5874434) (← links)
- (Q5875583) (← links)
- LATIN 2004: Theoretical Informatics (Q5901647) (← links)