T. S. Indulekha

T. S. Indulekha


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2018
Verified
Conference Paper
Closed access
TIT. S. Indulekha
T. S. Indulekha
GAG.S. Aswathy
G.S. Aswathy
PSParvathy Sudhakaran
Parvathy Sudhakaran
Identification of genes which cause a particular disease in humans is a main objective of hereditary genetics. Such genes are said to be disease genes. Several natural techniques are accessible to recognize disease genes. The candidate genes should be additionally explored to distinguish the disease causing genes. Scholars must organize the genes from most to minimum promising while carrying out the validation procedure. This is essential for reducing the cost required for experimental testing. The idea here is to prioritize candidate genes in a protein-protein interaction network based on community detection. We implement a method to prioritize the candidate genes in PPI network. We tested the efficiency of our algorithm over the existing algorithms.

21 June 2022 in Algorithms
Verified
Journal Article
Open access
PDF file
TIT. S. Indulekha
T. S. Indulekha
BCBhadrachalam Chitturi
Bhadrachalam Chitturi
Sorting permutations with various operations has applications in genetics and computer interconnection networks where an operation is specified by its generator set. A transposition tree T=(V,E) is a spanning tree over n vertices v1,v2,…vn. T denotes an operation in which each edge is a generator. A value assigned to a vertex is called a token or a marker. The markers on vertices u and v can be swapped only if the pair (u,v)∈E. The initial configuration consists of a bijection from the set of vertices v1,v2,…,vn to the set of markers (1,2,⋯,n−1,n). The goal is to sort the initial configuration of T, i.e., an input permutation, by applying the minimum number of swaps or moves in T. Computationally tractable optimal algorithms to sort permutations are known only for a few classes of transposition trees. We study a class of transposition trees called a broom and its variation a double broom. A single broom is a tree obtained by joining the centre vertex of a star with one of the two leaf vertices of a path graph. A double broom is an extension of a single broom where the centre vertex of a second star is connected to the terminal vertex of the path in a single broom. We propose a simple and efficient algorithm to obtain an optimal swap sequence to sort permutations with the transposition tree broom and a novel optimal algorithm to sort permutations with a double broom. We also introduce a new class of trees named millipede tree and prove that D* yields a tighter upper bound for sorting permutations with a balanced millipede tree compared to D′. Algorithms D* and D′ are designed previously.

1 December 2015
Verified
Conference Paper
Closed access
BCBhadrachalam Chitturi
Bhadrachalam Chitturi
JTJyothi Thomas
Jyothi Thomas
TIT. S. Indulekha
T. S. Indulekha
Discovering human activities facilitates computerization and the consequent monitoring of the smart home environment. The existing unsupervised human activity discovery systems perform segmentation clustering followed by the labeling of the sensor data. Segmentation clustering consists of forming segments from similar consecutive frames and then clustering similar segments. A cluster is labeled by the action associated with its most frequent sensor(s). In these methods, even if similar segments denote distinct activities they often occur in the same cluster. We propose three alternate methods to address this issue. The first method is a minor variant of the segmentation clustering where subsequences of the segments are clustered instead of the segments. We employ the concept of cover where (a, b, c) subsumes (a, c) if they have identical frequency. The second method employs a new algorithm, i.e. LRS, instead of segmentation. The third method is a hybrid method that extracts subsequences from the output of LRS. We compared the proposed systems with the existing system on CASAS dataset, a real world human activity dataset. The third method that employs LRS followed by subsequence extraction yielded the best Dunn's index and the best correctness in clusters as per confusion matrix.

8 August 2024
Verified
Conference Paper
Open access
AVAshtapadhi S V
Ashtapadhi S V
DPDevi Pillai
Devi Pillai
TIT. S. Indulekha
T. S. Indulekha
In today’s rapidly evolving landscape, where genetic research and the optimization of computer networks hold immense importance, understanding genetic mutations and fine-tuning network performance are critical endeavors with profound impacts. Permutations serve as an essential tool in both genomic studies and computer networks, providing versatile methods for understanding genetic variations and enhancing network efficiency. Permutations are used in genomics to represent genomes, where the source genome is denoted by π1 and the target genome by π2. The genomic distance, also known as inter-species distance, quantifies the minimum modifications required to transform π1 into π2. Similarly, permutations are used in computer networks to represent nodes, often visualised through graphs like the Cayley graph, where the graph’s diameter determines the maximum delay between network nodes. Sorting permutation refers to the transformation of a permutation π to its form of identity I. Various operations such as adjacent swaps, block transpositions, prefix transpositions, and transposition trees can be applied for sorting permutations. This research particularly focuses on transposition trees. Sorting of permutations using transposition trees is an NP-hard problem in general. Although, there are effective algorithms that optimally sort certain types of transposition trees such as star, path and brooms, developing such algorithms for more general transposition trees remains a challenge. A notable structure is the balanced starburst, formed by connecting the centers of k stars (k > 2) to a common center vertex (c), for which optimal algorithms and upper bounds are yet unknown. In this paper, we explore the sorting of permutations with the balanced starburst transposition tree, aiming to establish an upper bound.

19 November 2018 in arXiv
Verified
Preprint
Open access
PDF file
BCBhadrachalam Chitturi
Bhadrachalam Chitturi
TIT. S. Indulekha
T. S. Indulekha
The set of all permutations with $n$ symbols is a symmetric group denoted by $S_n$. A transposition tree, $T$, is a spanning tree over its $n$ vertices $V_T=${$1, 2, 3, \ldots n$} where the vertices are the positions of a permutation $\pi$ and $\pi$ is in $S_n$. $T$ is the operation and the edge set $E_T$ denotes the corresponding generator set. The goal is to sort a given permutation $\pi$ with $T$. The number of generators of $E_T$ that suffices to sort any $\pi \in S_n$ constitutes an upper bound. It is an upper bound, on the diameter of the corresponding Cayley graph $\Gamma$ i.e. $diam(\Gamma)$. A precise upper bound equals $diam(\Gamma)$. Such bounds are known only for a few trees. Jerrum showed that computing $diam(\Gamma)$ is intractable in general if the number of generators is two or more whereas $T$ has $n-1$ generators. For several operations computing a tight upper bound is of theoretical interest. Such bounds have applications in evolutionary biology to compute the evolutionary relatedness of species and parallel/distributed computing for latency estimation. The earliest algorithm computed an upper bound $f(\Gamma)$ in a $\Omega(n!)$ time by examining all $\pi$ in $S_n$. Subsequently, polynomial time algorithms were designed to compute upper bounds or their estimates. We design an upper bound $\delta^*$ whose cumulative value for all trees of a given size $n$ is shown to be the tightest for $n \leq 15$. We show that $\delta^*$ is tightest known upper bound for full binary trees. Keywords: Transposition trees, Cayley graphs, permutations, sorting, upper bound, diameter, greedy algorithms.

1 June 2026 in Bulletin of Electrical Engineering and Informatics
Verified
Journal Article
Open access
PDF file
SSSreelatha Kakkattumadathil Sreenivasan
Sreelatha Kakkattumadathil Sreenivasan
JKJanardhanan Suresh Kumar
Janardhanan Suresh Kumar
TIT. S. Indulekha
T. S. Indulekha
NKNarayanankutty Karuppath
Narayanankutty Karuppath
In this paper, we study three graph parameters–the iterated chromatic number xn(G), the iterated domination number yn(G), and the iterated covering num- ber Bn(G)—through the line-graph transformations applied successively on a connected graph G. These edge-iterated parameters track how coloring, domination, and covering structures evolve as the graph undergoes successive linegraph transformations. For standard graph families such as paths, cycles, and grid graphs, we derive exact formulas and establish upper and lower bounds, revealing both periodic and divergent behaviours depending on graph structure. Since exact computation of these parameters becomes intractable for large networks, we propose a BFS-based greedy algorithm for estimating xn(G), and benchmark it against the Welsh–Powell and DSATUR algorithms. The simulation results validate the theoretical bounds and show that the proposed method is computationally efficient without significant loss in coloring quality. We further show that these parameters have natural interpretations in wireless sensor networks (WSNs): xn(G) informs frequency and time-slot assignment under multi-hop interference, yn(G) identifies minimal supervisory structures for fault tolerance, and Bn(G) guides energy-aware link monitoring. The framework thus connects iterated graph theory to concrete design problems in sensor network optimization.