Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/22785
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKUMAR, VANI-
dc.contributor.authorKansal, Sangita (SUPERVISOR)-
dc.date.accessioned2026-06-08T05:48:59Z-
dc.date.available2026-06-08T05:48:59Z-
dc.date.issued2026-05-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/22785-
dc.description.abstractIdentifying non-redundant therapeutic target combinations in Mycobacterium tuberculosis is both a pressing clinical problem, driven by obligate multi-drug regimens and escalating resis tance. This is a natural instance of the maximum weighted independent set (MWIS) problem on a biologically structured graph. We present a spectral-geometric framework that formalises this correspondence and exploits it computationally. From the Mtb H37Rv protein-protein in teraction (PIP) network, constructed by integrating multiple experimental evidence sources, we derive a composite target relevance score encoding Tn-seq essentiality, structural drugga bility, and host-specificity. Embedding the network spectrally through the graph Laplacian, we construct a target-interference graph Hω =(U,Fω) by connecting candidate proteins whose pairwise spectral distance falls below a threshold ω, encoding functional proximity as the in terference relation. The weighted Lov´asz theta function ε( ¯ Hω,p) then provides a polynomial time SDP upper bound on the MWISofHω, witharounded solution approximating the optimal non-redundant target combination. We establish that when Hω is constructed from the Fiedler coordinate alone, it is an interval graph and therefore perfect. By the Lov´asz sandwich theorem, ε( ¯Hω,p)=ϑ(Hω,p) exactly, and the SDP solves the weighted target selection problem in poly nomial time. For embeddings of dimension k → 2, Hω is a unit ball intersection graph in Rk and we characterise the resulting integrality gap as a function of k, establishing a formal trade-off between spectral expressiveness and algorithmic tractability. Applied to the Mtb H37Rv inter actome, the SDP-rounded target sets recover established drug targets, including KatG, InhA, and DprE1, within the computed independent set, and the identified combinations span func tionally disjoint subsystems encompassing cell wall biosynthesis, central carbon metabolism, and DNA replication, consistent with the network-pharmacological rationale underlying com bination anti-TB therapy.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTD-8706;-
dc.subjectASPECTRAL-GEOMETRIC FRAMEWORKen_US
dc.subjectDRUG TARGET SELECTIONen_US
dc.subjectWEIGHTED LOVen_US
dc.subjectTHETA FUNCTIONen_US
dc.subjectTB THERAPYen_US
dc.titleA SPECTRAL-GEOMETRIC FRAMEWORK FOR NON-REDUNDANT DRUG TARGET SELECTION VIA THE WEIGHTED LOV´ ASZ THETA FUNCTIONen_US
dc.typeThesisen_US
Appears in Collections:M Sc Applied Maths

Files in This Item:
File Description SizeFormat 
Vani Kumar m.sc..pdf2.02 MBAdobe PDFView/Open
Vani Kumar plag.pdf2.21 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.