Homogeneous string segmentation using trees and weighted independent sets

DOI10.1007/s00453-008-9225-8zbMath1203.68190OpenAlexW2109115409MaRDI QIDQ972999

Peter Damaschke

Publication date: 28 May 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9225-8

zbMATH Keywords

dynamic programmingsegmentationinterval graphsparameterized complexityweighted independent settree computations

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• On the handling of continuous-valued attributes in decision tree generation
• Bilinear separation of two sets in \(n\)-space
• A dynamic programming algorithm for linear text segmentation
• General and efficient multisplitting of numerical attributes
• On Floyd and Rivest's SELECT algorithm
• Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
• Computing Maximum-Scoring Segments in Almost Linear Time
• Data-streams and histograms