Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Bhadrachalam Chitturi"'
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:
Algorithms, Vol 15, Iss 7, p 220 (2022)
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 denot
Externí odkaz:
https://doaj.org/article/444432336d374f0ba6f8dcb8376a42fd
Publikováno v:
Algorithms, Vol 11, Iss 7, p 93 (2018)
The computation of distances between strings has applications in molecular biology, music theory and pattern recognition. One such measure, called short reversal distance, has applications in evolutionary distance computation. It has been shown that
Externí odkaz:
https://doaj.org/article/b414b5eae5f641019cd24af10b3ad8a8
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e40d7e27014f84c9028822da49a359d
https://doi.org/10.1016/j.tcs.2021.10.012
https://doi.org/10.1016/j.tcs.2021.10.012
Autor:
Jayakumar Pai, Bhadrachalam Chitturi
Publikováno v:
Theoretical Computer Science. 891:105-115
Sorting permutations with various operations has applications in macro rearrangement of genes in a genome and the design of computer interconnection networks. Block-interchange is a powerful operation that swaps two substrings that are called as bloc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e96a89c5c150663bab31da7d0740c908
https://doi.org/10.1016/j.tcs.2021.08.031
https://doi.org/10.1016/j.tcs.2021.08.031
Publikováno v:
Procedia Computer Science. 171:72-80
Cayley graphs are constructed over n! vertices that denote n! permutations of the symmetric group Sn. The edge set of a particular Cayley graph Γ is determined by the corresponding operation that consists of a well defined generator set. One such op
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54c955e226627eec08c86c53167c201f
https://doi.org/10.1016/j.procs.2020.04.008
https://doi.org/10.1016/j.procs.2020.04.008
Autor:
Deepak S, Bhadrachalam Chitturi
Publikováno v:
Procedia Computer Science. 167:2236-2243
The complexities of fake news detection cannot be overcome solely with Natural Language Processing. Even a human being finds it difficult to decide the authenticity of an article without further fact checking. Hence a Deep Learning model entirely bas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f3fcb560e7645476f19efa794ce1e16
https://doi.org/10.1016/j.procs.2020.03.276
https://doi.org/10.1016/j.procs.2020.03.276
Autor:
Bhadrachalam Chitturi, Priyanshu Das
Publikováno v:
Theoretical Computer Science. 766:30-37
The problem of sorting a permutation π over alphabet ∑ = { 1 , 2 , 3 … n } with the minimum number of transpositions is known to be intractable. That is, the computation of transposition distance i.e. d t ( π ) , is hard. Such sorting is equiva
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82638ab2025511d4405870d6b9a86fce
https://doi.org/10.1016/j.tcs.2018.09.015
https://doi.org/10.1016/j.tcs.2018.09.015
Publikováno v:
Communications in Computer and Information Science ISBN: 9789811604034
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4de5d40b30c2201fd8aac4fe0af6ebc
https://doi.org/10.1007/978-981-16-0404-1_21
https://doi.org/10.1007/978-981-16-0404-1_21
