Efficient Approaches for Permutation-Constrained Common String Partitions : Novel Integer Linear Programming and Heuristic Approaches in Text Mining

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Efficient Approaches for Permutation-Constrained Common String Partitions : Novel Integer Linear Programming and Heuristic Approaches in Text Mining
Συγγραφείς: Huynh, Trong Thua
Πηγή: Proceedings of the 2025 10th International Conference on Cloud Computing and Internet of Things. :75-81
Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3785520.3785531
Βάση Δεδομένων: ACM Full-Text Collection