"An Average-Case Efficient Two-Stage Algorithm for Enumerating All Longest ..."

Mattia Prosperi, Simone Marini, Christina Boucher (2024)

> Home

Details and statistics

DOI: 10.1109/ICHI61247.2024.00020

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ichi/ProsperiM024
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ichi/ProsperiM024
Mattia Prosperi, Simone Marini, Christina Boucher:
An Average-Case Efficient Two-Stage Algorithm for Enumerating All Longest Common Substrings of Minimum Length $k$ Between Genome Pairs. ICHI 2024: 93-102

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.