Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Rajan Sundaravaradhan"'
Publikováno v:
Mathematics, Vol 12, Iss 17, p 2620 (2024)
With applications in computer networks, robotics, genetics, data center network optimization, cryptocurrency exchange, transportation and logistics, cloud computing, and social network analysis, the problem of sorting permutations on transposition tr
Externí odkaz:
https://doaj.org/article/c3d7153ee97a4b969d462cbbd6ac5f0a
Publikováno v:
Theoretical Computer Science. 896:158-167
Modelling of chromosomes with permutations has triggered the research of sorting permutations using global rearrangement operations in computational molecular biology. One such rearrangement is transposition which swaps two adjacent substrings. If on
Autor:
Rajan Sundaravaradhan, Pramod P. Nair
Publikováno v:
2020 Advanced Computing and Communication Technologies for High Performance Applications (ACCTHPA).
Genome rearrangement problems in Genomics are studied extensively due to their significance in the evolution theory and detection of hereditary illnesses. This is a challenging problem in Big Data science for Computational Biologist due to the large
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 12:2050077
Permutations are discrete structures that naturally model a genome where every gene occurs exactly once. In a permutation over the given alphabet [Formula: see text], each symbol of [Formula: see text] appears exactly once. A transposition operation
Autor:
Rajan Sundaravaradhan
Publikováno v:
International Mathematics Research Notices.