Linear time maximum segmentation problems in column stream model

DOI10.1007/978-3-030-32686-9_23zbMATH Open1539.68105MaRDI QIDQ6536264FDOQ6536264

Authors: Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri 

Publication date: 19 April 2024

Recommendations

• Minimum segmentation for pan-genomic founder reconstruction in linear time
• Linear time construction of indexable founder block graphs
• An optimal algorithm for the maximum-density segment problem
• scientific article; zbMATH DE number 1945170
• Computing Maximum-Scoring Segments in Almost Linear Time

zbMATH Keywords

dynamic programmingpositional Burrows-Wheeler transformfounder reconstructionpan-genome indexingrange maximum queue

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Genetics and epigenetics (92D10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Cites Work

• Title not available (Why is that?)
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Minimum segmentation for pan-genomic founder reconstruction in linear time
• Minimum mosaic inference of a set of recombinants
• Title not available (Why is that?)

This page was built for publication: Linear time maximum segmentation problems in column stream model

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