scispace - formally typeset
Search or ask a question
Author

Kalpana Mahalingam

Bio: Kalpana Mahalingam is an academic researcher from Indian Institute of Technology Madras. The author has contributed to research in topics: Palindrome & Combinatorics on words. The author has an hindex of 11, co-authored 62 publications receiving 436 citations. Previous affiliations of Kalpana Mahalingam include University of Western Ontario & University of South Florida.


Papers
More filters
Book ChapterDOI
02 Oct 2012
TL;DR: It is shown that one fe- system can generate the entire class of DNA codes of a certain property, for example θ-k-codes, and confirm some properties of DNA code words through fe-systems.
Abstract: Research in DNA computing was initiated by Leonard Adleman in 1994 when he solved an instance of an NP-complete problem solely by molecules. DNA code words arose in the attempt to avoid unwanted hybridizations of DNA strands for DNA based computations. Given a set of constraints, generating a large set of DNA strands that satisfy the constraints is an important problem in DNA computing. On the other hand, motivated by the non-determinism of molecular reactions, A. Ehrenfeucht and G. Rozenberg introduced forbidding and enforcing systems (fe-systems) as a model of computation that defines classes of languages based on two sets of constraints. We attempt to establish a connection between these two areas of research in natural computing by characterizing a variety of DNA codes that avoid certain types of cross hybridizations by fe-systems. We show that one fe-system can generate the entire class of DNA codes of a certain property, for example θ-k-codes, and confirm some properties of DNA codes through fe-systems. We generalize by fe-systems some known methods of generating good DNA code words which have been tested experimentally.

5 citations

Book ChapterDOI
01 Jan 2010
TL;DR: Kalpana Mahalingam Indian Institute of Technology, Chennai is celebrating its 30th anniversary with a convocation ceremony to mark the occasion.
Abstract: Kalpana Mahalingam Indian Institute of Technology 31.

4 citations

Journal Article
TL;DR: The motion of a robot inside a rectangular grid is simulated using Isotonic Array P System (IAPS), defined by Sureshkumar and Rama in 2015 and a polynomial time algorithm has been proposed using this grammatical model to find the shortest path with and/or without obstacles.
Abstract: The motion of a robot inside a rectangular grid is simulated using Isotonic Array P System (IAPS)defined by Sureshkumar and Rama in 2015. A polynomial time algorithm has been proposed using this grammatical model to find the shortest path with and/or without obstacles. The obstacles are usually assumed be of polygonal shape in the rectangular grid.

4 citations

Journal ArticleDOI
TL;DR: The Parikh matrix mapping plays an important role in the study of words through numerical properties and is introduced by Egecioglu and Ibarra (2004) as an extension of the P-matrix mapping.
Abstract: The Parikh matrix mapping plays an important role in the study of words through numerical properties. The Parikh q-matrix mapping, introduced by Egecioglu and Ibarra (2004) as an extension of the P...

4 citations

Proceedings ArticleDOI
27 Sep 2011
TL;DR: A generative device known as a Watson-Crick context-free system (WKCFS) making use of a complementarity relation and a context- free type of rewriting on double-stranded strings with the symbols in the string in the lower strand complementary to the symbols of theString in the upper strand.
Abstract: Motivated by the studies on Watson-Crick finite automata and Watson-Crick L systems, we introduce a generative device known as a Watson-Crick context-free system (WKCFS) making use of a complementarity relation and a context-free type of rewriting on double-stranded strings with the symbols in the string in the lower strand complementary to the symbols of the string in the upper strand. The language generated by a WKCFS is the set of all strings in the upper strands of the double-stranded strings (u, v) generated such that the strings u, v are of the same length and the corresponding symbols in the strings u, v are related by the complementarity relation. We compare the generative power of WKCFS with some families of languages and also certain variants of Watson-Crick finite automata.

4 citations


Cited by
More filters
Journal ArticleDOI
07 Feb 2013-Nature
TL;DR: Theoretical analysis indicates that the DNA-based storage scheme could be scaled far beyond current global information volumes and offers a realistic technology for large-scale, long-term and infrequently accessed digital archiving.
Abstract: Digital production, transmission and storage have revolutionized how we access and use information but have also made archiving an increasingly complex task that requires active, continuing maintenance of digital media. This challenge has focused some interest on DNA as an attractive target for information storage because of its capacity for high-density information encoding, longevity under easily achieved conditions and proven track record as an information bearer. Previous DNA-based information storage approaches have encoded only trivial amounts of information or were not amenable to scaling-up, and used no robust error-correction and lacked examination of their cost-efficiency for large-scale information archival. Here we describe a scalable method that can reliably store more information than has been handled before. We encoded computer files totalling 739 kilobytes of hard-disk storage and with an estimated Shannon information of 5.2 × 10(6) bits into a DNA code, synthesized this DNA, sequenced it and reconstructed the original files with 100% accuracy. Theoretical analysis indicates that our DNA-based storage scheme could be scaled far beyond current global information volumes and offers a realistic technology for large-scale, long-term and infrequently accessed digital archiving. In fact, current trends in technological advances are reducing DNA synthesis costs at a pace that should make our scheme cost-effective for sub-50-year archiving within a decade.

900 citations

Journal Article
TL;DR: Reading molecular biology of the gene is also a way as one of the collective books that gives many advantages, not only for you, but for the other peoples with those meaningful benefits.
Abstract: No wonder you activities are, reading will be always needed. It is not only to fulfil the duties that you need to finish in deadline time. Reading will encourage your mind and thoughts. Of course, reading will greatly develop your experiences about everything. Reading molecular biology of the gene is also a way as one of the collective books that gives many advantages. The advantages are not only for you, but for the other peoples with those meaningful benefits.

718 citations

ReportDOI
31 May 1993
TL;DR: Significant progress has been made with solution of location problems and in preprocessing and decomposition for discrete optimization and on the application of techniques from combinational optimization to nonlinear problems.
Abstract: : Significant progress has been made with solution of location problems and in preprocessing and decomposition for discrete optimization. There has also been research on the application of techniques from combinational optimization to nonlinear problems.

421 citations

Journal ArticleDOI
20 Jan 2009
TL;DR: Only for you today!
Abstract: Only for you today! Discover your favourite computation in living cells gene assembly in ciliates 1st edition book right here by downloading and getting the soft file of the book. This is not your time to traditionally go to the book stores to buy a book. Here, varieties of book collections are available to download. One of them is this computation in living cells gene assembly in ciliates 1st edition as your preferred book. Getting this book b on-line in this site can be realized now by visiting the link page to download. It will be easy. Why should be here?

80 citations

Journal ArticleDOI
TL;DR: An overview of existing approaches to encoding information on DNA strands for biocomputing, with a focus on the notion of Watson–Crick (WK) palindromes, and obtains a closed form for, as well as several properties of WK palINDromes.
Abstract: This paper provides an overview of existing approaches to encoding information on DNA strands for biocomputing, with a focus on the notion of Watson---Crick (WK) palindromes. We obtain a closed form for, as well as several properties of WK palindromes: The set of WK-palindromes is dense, context-free, but not regular, and is in general not closed under catenation and insertion. We obtain some properties that link the WK palindromes to classical notions such as that of primitive words. For example we show that the set of WK-palindromic words that cannot be written as the product of two nonempty WK-palindromes equals the set of primitive WK-palindromes. We also investigate various simultaneous Watson---Crick conjugate equations of words and show that the equations have, in most cases, only Watson---Crick palindromic solutions. Our results hold for more general functions, such as arbitrary morphic and antimorphic involutions.

53 citations