Name
Affiliation
Papers
XAVIER MESSEGUER
Dept. of Computer Science, Technical University of Catalonia, Barcelona, Spain
28
Collaborators
Citations 
PageRank 
44
227
32.13
Referers 
Referees 
References 
614
568
227
Search Limit
100614
Title
Citations
PageRank
Year
easyDAS: Automatic creation of DAS servers.80.342011
A Novel Heuristic for Local Multiple Alignment of Interspersed DNA Repeats10.352009
Novel Computational Methods for Large Scale Genome Comparison00.342008
Gapped extension for local multiple alignment of interspersed DNA repeats10.392008
Implementing an Interactive Web-Based DAS Client00.342008
Multiple non-collinear TF-map alignments of promoter regions.170.542007
Abs: A Database Of Annotated Regulatory Binding Sites From Orthologous Promoters311.332006
Transcription Factor Map Alignment Of Promoter Regions50.532006
Procrastination leads to efficient filtration for local multiple alignment100.572006
M-GCAT: interactively and efficiently constructing large-scale multiple genome comparison frameworks in closely related species401.272006
Prediction of Transcription Factor Binding Sites with PROMO v.3: Improving the Specificity of Weight Matrices and the Searching Process10.392004
M-GCAT: Multiple Genome Comparison and Alignment Tool20.432004
Proceedings of the 5th Annual Spanish Bioinformatics Conference, Barcelona, Catalonia, Spain, November 29-30, 20046016.452004
Multiple Sequence Alignment for Characterizing the Lineal Structure of Revision.20.672004
Identification Of Patterns In Biological Sequences At The Alggen Server: Promo And Malgen50.672003
MREPATT: detection and analysis of exact consecutive repeats in genomic sequences.20.452003
Fringe analysis of synchronized parallel insertion algorithms in 2-3 Trees00.342003
DnaSP, DNA polymorphism analyses by the coalescent and other methods.141.982003
PROMO: detection of known transcription regulatory elements using species-tailored searches.40.712002
Relaxed Tree Structures, a Way to Deal with Concurrency and Parallelism on Dictionaries00.341998
Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees10.361998
Parallel dictionaries with local rules on AVL and brother trees10.361998
Skip Trees, an Alternative Data Structure to Skip Lists in a Concurrent Approach80.591997
Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract)20.431997
A Unified Approach to Concurrent and Parallel Algorithms on Balanced Data Structures (Invited Paper)00.341997
A design of a parallel dictionary using skip lists80.811996
Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs30.431993
Dynamic behaviour in updating process over BST of size two with probabilistic deletion algorithms10.381991