Search

2 articles for “Substring search”

• Published Subscription Original Research 7 Jul 2023

  Searching Substring in O(n) Time Complexity

  By Abhay A. Nigadikar, Ilyas Shaikh, Sharada Patil

  Abstract: This research paper presents a highly efficient algorithm for substring search within a given string, achieving a remarkable time complexity of O(n). The proposed algorithm utilizes a two-pointer approach to compare the given string with the targeted substring. By employing string concatenation, the algorithm dynamically constructs a resultant substring during the matching process. Upon completion of character matching, the algorithm compares the resultant substring with the targeted substring and returns …

  Published in International Journal of Algorithms Design and Analysis Review · Vol. 1, Issue 1, 2023 · pp. 9–15 Read article →

• Published Subscription Original Research 6 May 2026

  Predicting Dielectric Constants of Polymers Using Molecular Structural Descriptors and Explainable Machine Learning: A Data-Driven Approach

  By C. Sridhathan, R. Arangasamy, Geetha Prahalad, Mohandass G., N.M.G. Kumar, M. Ram Prasad Reddy

  Abstract: Accurate prediction of dielectric constants in polymeric materials is fundamental to the rational design of advanced electronic components, energy storage capacitors, flexible substrates, and high-frequency communication circuits. Conventional approaches to identifying suitable polymer dielectrics rely on extensive experimental synthesis and characterisation, which are both time-consuming and resource-intensive. In this work, an explainable machine learning framework is developed to predict the dielectric constant of polymers directly from molecular structural descriptors derived …

  Published in Journal of Polymer & Composites · Vol. 14, Issue 3, 2026 · pp. 297–304 Read article →