Bhadrachalam Chitturi

According to our database1, Bhadrachalam Chitturi authored at least 27 papers between 2008 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Exact upper bound for sorting Rn with LE.
Discret. Math. Algorithms Appl., 2020

An Upper Bound for Sorting R<sub>n</sub> with LRE.
CoRR, 2020

2019
Sorting permutations with transpositions in <i>O</i>(<i>n</i><sup>3</sup>) amortized time.
Theor. Comput. Sci., 2019

2018
Sorting permutations with a transposition tree.
CoRR, 2018

Minimum-Link Rectilinear Covering Tour is NP-hard in R<sup>4</sup>.
CoRR, 2018

Layered Graphs: Applications and Algorithms.
Algorithms, 2018

Counting Chemical Structures Resembling Trees.
Proceedings of the 2018 International Conference on Advances in Computing, 2018

Scheduling Applications of DAGs.
Proceedings of the 2018 International Conference on Advances in Computing, 2018

2017
Distances in and Layering of a DAG.
CoRR, 2017

Layered graphs: a class that admits polynomial time solutions for some hard problems.
CoRR, 2017

Bounding the diameter of cayley graphs generated by specific transposition trees.
Proceedings of the 2017 International Conference on Advances in Computing, 2017

Deep learning model on stance classification.
Proceedings of the 2017 International Conference on Advances in Computing, 2017

2016
Adjacencies in Permutations.
CoRR, 2016

A study of gene prioritization algorithms on PPI networks.
Proceedings of the 2016 International Conference on Advances in Computing, 2016

2015
Tighter upper bound for sorting permutations with prefix transpositions.
Theor. Comput. Sci., 2015

2013
Erratum: "Upper Bounds for Sorting Permutations with a Transposition Tree".
Discret. Math. Algorithms Appl., 2013

Upper Bounds for Sorting Permutations with a Transposition Tree.
Discret. Math. Algorithms Appl., 2013

2012
Bounding prefix transposition distance for strings and permutations.
Theor. Comput. Sci., 2012

Self consistency grouping: a stringent clustering method.
BMC Bioinform., 2012

Prediction of candidate genes for neuropsychiatric disorders using feature-based enrichment.
Proceedings of the ACM International Conference on Bioinformatics, 2012

2011
A Note on Complexity of Genetic mutations.
Discret. Math. Algorithms Appl., 2011

2010
Prefix Reversals on Strings.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2010

On Complexity of Transforming Strings.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2010

2009
An (18/11)n upper bound for sorting by prefix reversals.
Theor. Comput. Sci., 2009

ProSMoS server: a pattern-based search using interaction matrix representation of protein structures.
Nucleic Acids Res., 2009

Sorting Circular Permutations by Bounded Transpositions.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2009

2008
Adjacent Swaps on Strings.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008


  Loading...