Author
Kalpana Mahalingam
Other affiliations: University of Western Ontario, University of South Florida, Indian Institutes of Technology
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 published on a yearly basis
Papers
More filters
TL;DR: This paper builds upon an earlier initiated study and gives general methods for obtaining sets of code words with the same properties and shows that some of these code words have enough entropy to encode {0,1}* in a symbol-to-symbol mapping.
Abstract: The set of all sequences that are generated by a biomolecular protocol forms a language over the four letter alphabet Δ={A,G,C,T}. This alphabet is associated with a natural involution mapping θ, A↦T and G↦C which is an antimorphism of Δ*. In order to avoid undesirable Watson-Crick bonds between the words (undesirable hybridization), the language has to satisfy certain coding properties. In this paper we build upon an earlier initiated study and give general methods for obtaining sets of code words with the same properties. We show that some of these code words have enough entropy to encode {0,1}* in a symbol-to-symbol mapping.
4 citations
TL;DR: A relation between the block reversal and the non-overlapping inversion defined by Schoniger and Waterman in the year 1992 is found and the distribution of palindromes in the block reversed word is studied.
3 citations
13 Apr 2019
TL;DR: The set of all Fibonacci arrays is a 2D primitive language (under certain conditions), count the number of borders in Fib onacci arrays, and show that the set ofall Fiboncians is a non-recognizable language.
Abstract: The non-trivial extension of Fibonacci words to Fibonacci arrays was proposed by Apostolico and Brimkov in order to study repetitions in arrays. In this paper we investigate several combinatorial as well as formal language theoretic properties of Fibonacci arrays. In particular, we show that the set of all Fibonacci arrays is a 2D primitive language (under certain conditions), count the number of borders in Fibonacci arrays, and show that the set of all Fibonacci arrays is a non-recognizable language. We also show that the set of all square Fibonacci arrays is a two dimensional code.
3 citations
26 Jun 2006
TL;DR: In this article, a generalization of the classical notions of solid codes and comma-free codes, called involution solid codes (θ-solid) and involution join codes (ε-join), was proposed.
Abstract: In this paper we study a generalization of the classical notions of solid codes and comma-free codes: involution solid codes (θ-solid) and involution join codes (θ-join). These notions are motivated by DNA strand design where Watson-Crick complementarity can be formalized as an antimorphic involution. We investigate closure properties of these codes, as well as necessary conditions for θ-solid codes to be maximal. We show how the concept of θ-join can be utilized such that codes that are not themselves θ-comma free can be split into a union of subcodes that are θ-comma free.
3 citations
TL;DR: In this article, the maximum number of distinct palindromic sub-words in a two-dimensional finite word was investigated and tight bounds were given for two-row periodic/aperiodic words.
Abstract: We investigate the maximum number of distinct palindromic sub-words in a two-dimensional finite word. We give tight bounds for the maximum number of distinct palindromic sub-words in two-row periodic/aperiodic words. Using this, we give upper bounds for the number of distinct palindromic sub-words for 2D words of larger sizes. Lastly, we propose a better bound for any finite 2D word.
2 citations
Cited by
More filters
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
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
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
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