15 citations · 25 across the 6 of their papers we have counts for
6 papers
Algorithmic complexity in computational biology: basics, challenges and limitations
Davide Cirillo, Miguel Ponce-de-Leon, Alfonso Valencia
Computational problems can be classified according to their algorithmic complexity, which is defined based on how the resources needed to solve the problem, e.g. the execution time…
Integrating epigenomic data and 3D genomic structure with a new measure of chromatin assortativity
Vera Pancaldi, Enrique Carrillo-de-Santa-Pau, Biola Maria Javierre +5
Network analysis is a powerful way of modeling chromatin interactions. Assortativity is a network property used in social sciences to identify factors affecting how people establis…
The shrinking human protein coding complement: are there now fewer than 20,000 genes?
Iakes Ezkurdia, David Juan, Jose Manuel Rodriguez +6
Determining the full complement of protein-coding genes is a key goal of genome annotation. The most powerful approach for confirming protein coding potential is the detection of c…
Late-replicating CNVs as a source of new genes
David Juan, Daniel Rico, Tomas Marques-Bonet +2
Asynchronous replication of the genome has been associated with different rates of point mutation and copy number variation (CNV) in human populations. Here, we explored if the bia…
Accurate Demarcation of Protein Domain Linkers based on Structural Analysis of Linker Probable Region
Vivekanand Samant, Arvind Hulgeri, Alfonso Valencia +1
In multi-domain proteins, the domains are connected by a flexible unstructured region called as protein domain linker. The accurate demarcation of these linkers holds a key to unde…
Mirroring co-evolving trees in the light of their topologies
Iman Hajirasouliha, Alexander Schönhuth, David Juan +2
Determining the interaction partners among protein/domain families poses hard computational problems, in particular in the presence of paralogous proteins. Available approaches aim…