Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xavier Messeguer

dblp:10/1292 · also Xavier Messeguer Peypoch · DBLP profile ↗
← Back
18ranked-venue papers
2as first author
0since 2021 · last 2011
0000-0001-7430-4857ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 10 · 1 first-authorTheory of computation · 6 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorArtificial intelligence and machine learning · 1Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › population genetics › genetic variation analysis
DNA polymorphism analysis
0.012003
DnaSP, DNA polymorphism analyses by the coalescent and other methods · Bioinform. 2003
Bioinformatics and computational biology › sequence analysis
genomic sequence analysis
0.012003
MREPATT: detection and analysis of exact consecutive repeats in genomic sequences · Bioinform. 2003
Bioinformatics and computational biology
population genetics
0.012003
DnaSP, DNA polymorphism analyses by the coalescent and other methods · Bioinform. 2003
Bioinformatics and computational biology › sequence analysis › repeat detection
tandem repeat detection
0.012003
MREPATT: detection and analysis of exact consecutive repeats in genomic sequences · Bioinform. 2003
Bioinformatics and computational biology
genomics
0.012002
PROMO: detection of known transcription regulatory elements using species-tailored searches · Bioinform. 2002
Bioinformatics and computational biology › gene regulation
transcription factor binding site prediction
0.012002
PROMO: detection of known transcription regulatory elements using species-tailored searches · Bioinform. 2002
Bioinformatics and computational biology › sequence analysis › sequence motif analysis
position weight matrix
0.012002
PROMO: detection of known transcription regulatory elements using species-tailored searches · Bioinform. 2002

Methods — techniques the papers use, named apart from their topics

statistical significance testing · 0.0monte carlo simulation · 0.0markov model · 0.0coalescent · 0.0
YearPublicationVenuePosition
2011 easyDAS: Automatic creation of DAS servers
abstract
BACKGROUND: The Distributed Annotation System (DAS) has proven to be a successful way to publish and share biological data. Although there are more than 750 active registered servers from around 50 organizations, setting up a DAS server comprises a fair amount of work, making it difficult for many research groups to share their biological annotations. Given the clear advantage that the generalized sharing of relevant biological data is for the research community it would be desirable to facilitate the sharing process. RESULTS: Here we present easyDAS, a web-based system enabling anyone to publish biological annotations with just some clicks. The system, available at http://www.ebi.ac.uk/panda-srv/easydas is capable of reading different standard data file formats, process the data and create a new publicly available DAS source in a completely automated way. The created sources are hosted on the EBI systems and can take advantage of its high storage capacity and network connection, freeing the data provider from any network management work. easyDAS is an open source project under the GNU LGPL license. CONCLUSIONS: easyDAS is an automated DAS source creation system which can help many researchers in sharing their biological data, potentially increasing the amount of relevant biological data available to the scientific community.
Bernat Gel, Andrew M. Jenkinson, Rafael C. Jiménez, Xavier Messeguer, Henning Hermjakob
BMC Bioinform.4
2009 A Novel Heuristic for Local Multiple Alignment of Interspersed DNA Repeats
abstract
Pairwise local sequence alignment methods have been the prevailing technique to identify homologous nucleotides between related species. However, existing methods that identify and align all homologous nucleotides in one or more genomes have suffered from poor scalability and limited accuracy. We propose a novel method that couples a gapped extension heuristic with an efficient filtration method for identifying interspersed repeats in genome sequences. During gapped extension, we use the MUSCLE implementation of progressive global multiple alignment with iterative refinement. The resulting gapped extensions potentially contain alignments of unrelated sequence. We detect and remove such undesirable alignments using a hidden Markov model (HMM) to predict the posterior probability of homology. The HMM emission frequencies for nucleotide substitutions can be derived from any time-reversible nucleotide substitution matrix. We evaluate the performance of our method and previous approaches on a hybrid data set of real genomic DNA with simulated interspersed repeats. Our method outperforms a related method in terms of sensitivity, positive predictive value, and localizing boundaries of homology. The described methods have been implemented in freely available software, Repeatoire, available from: http://wwwabi.snv.jussieu.fr/public/Repeatoire.
Todd J. Treangen, Aaron E. Darling, Guillaume Achaz, Mark A. Ragan, Xavier Messeguer, Eduardo P. C. Rocha
IEEE ACM Trans. Comput. Biol. Bioinform.5
2008 Gapped Extension for Local Multiple Alignment of Interspersed DNA Repeats
Todd J. Treangen, Aaron E. Darling, Mark A. Ragan, Xavier Messeguer
ISBRA4
2007 Multiple non-collinear TF-map alignments of promoter regions
abstract
BACKGROUND: The analysis of the promoter sequence of genes with similar expression patterns is a basic tool to annotate common regulatory elements. Multiple sequence alignments are on the basis of most comparative approaches. The characterization of regulatory regions from co-expressed genes at the sequence level, however, does not yield satisfactory results in many occasions as promoter regions of genes sharing similar expression programs often do not show nucleotide sequence conservation. RESULTS: In a recent approach to circumvent this limitation, we proposed to align the maps of predicted transcription factors (referred as TF-maps) instead of the nucleotide sequence of two related promoters, taking into account the label of the corresponding factor and the position in the primary sequence. We have now extended the basic algorithm to permit multiple promoter comparisons using the progressive alignment paradigm. In addition, non-collinear conservation blocks might now be identified in the resulting alignments. We have optimized the parameters of the algorithm in a small, but well-characterized collection of human-mouse-chicken-zebrafish orthologous gene promoters. CONCLUSION: Results in this dataset indicate that TF-map alignments are able to detect high-level regulatory conservation at the promoter and the 3'UTR gene regions, which cannot be detected by the typical sequence alignments. Three particular examples are introduced here to illustrate the power of the multiple TF-map alignments to characterize conserved regulatory elements in absence of sequence similarity. We consider this kind of approach can be extremely useful in the future to annotate potential transcription factor binding sites on sets of co-regulated genes from high-throughput expression experiments.
Enrique Blanco, Roderic Guigó, Xavier Messeguer
BMC Bioinform.3
2006 Procrastination Leads to Efficient Filtration for Local Multiple Alignment
Aaron E. Darling, Todd J. Treangen, Louxin Zhang, Carla Kuiken, Xavier Messeguer, Nicole T. Perna
WABI5
2006 M-GCAT: interactively and efficiently constructing large-scale multiple genome comparison frameworks in closely related species
abstract
BACKGROUND: Due to recent advances in whole genome shotgun sequencing and assembly technologies, the financial cost of decoding an organism's DNA has been drastically reduced, resulting in a recent explosion of genomic sequencing projects. This increase in related genomic data will allow for in depth studies of evolution in closely related species through multiple whole genome comparisons. RESULTS: To facilitate such comparisons, we present an interactive multiple genome comparison and alignment tool, M-GCAT, that can efficiently construct multiple genome comparison frameworks in closely related species. M-GCAT is able to compare and identify highly conserved regions in up to 20 closely related bacterial species in minutes on a standard computer, and as many as 90 (containing 75 cloned genomes from a set of 15 published enterobacterial genomes) in an hour. M-GCAT also incorporates a novel comparative genomics data visualization interface allowing the user to globally and locally examine and inspect the conserved regions and gene annotations. CONCLUSION: M-GCAT is an interactive comparative genomics tool well suited for quickly generating multiple genome comparisons frameworks and alignments among closely related species. M-GCAT is freely available for download for academic and non-commercial use at: http://alggen.lsi.upc.es/recerca/align/mgcat/intro-mgcat.html.
Todd J. Treangen, Xavier Messeguer
BMC Bioinform.2
2006 Transcription Factor Map Alignment of Promoter Regions
abstract
We address the problem of comparing and characterizing the promoter regions of genes with similar expression patterns. This remains a challenging problem in sequence analysis, because often the promoter regions of co-expressed genes do not show discernible sequence conservation. In our approach, thus, we have not directly compared the nucleotide sequence of promoters. Instead, we have obtained predictions of transcription factor binding sites, annotated the predicted sites with the labels of the corresponding binding factors, and aligned the resulting sequences of labels--to which we refer here as transcription factor maps (TF-maps). To obtain the global pairwise alignment of two TF-maps, we have adapted an algorithm initially developed to align restriction enzyme maps. We have optimized the parameters of the algorithm in a small, but well-curated, collection of human-mouse orthologous gene pairs. Results in this dataset, as well as in an independent much larger dataset from the CISRED database, indicate that TF-map alignments are able to uncover conserved regulatory elements, which cannot be detected by the typical sequence alignments.
Enrique Blanco, Xavier Messeguer, Temple F. Smith, Roderic Guigó
PLoS Comput. Biol.2
2004 Multiple Sequence Alignment for Characterizing the Lineal Structure of Revision
Laura Alonso Alemany, Irene Castellón, Jordi Escribano, Xavier Messeguer, Lluís Padró 0001
LREC4
2003 MREPATT: detection and analysis of exact consecutive repeats in genomic sequences
abstract
UNLABELLED: We have developed a program to determine the number, length and position of exact consecutive repeats of short sequences in DNA fragments or whole genomes. The program also gives the statistical significance of results by comparing them with those expected for a random sequence generated according to a Markovian model. AVAILABILITY: MREPATT can be accessed on line at http://www.lsi.upc.es/~alggen under the RESEARCH and SEARCH links.
Roman Roset, Juan A. Subirana, Xavier Messeguer
Bioinform.3
2003 DnaSP, DNA polymorphism analyses by the coalescent and other methods
abstract
SUMMARY: DnaSP is a software package for the analysis of DNA polymorphism data. Present version introduces several new modules and features which, among other options allow: (1) handling big data sets (approximately 5 Mb per sequence); (2) conducting a large number of coalescent-based tests by Monte Carlo computer simulations; (3) extensive analyses of the genetic differentiation and gene flow among populations; (4) analysing the evolutionary pattern of preferred and unpreferred codons; (5) generating graphical outputs for an easy visualization of results. AVAILABILITY: The software package, including complete documentation and examples, is freely available to academic users from: http://www.ub.es/dnasp
Julio Rozas, Juan C. Sánchez-DelBarrio, Xavier Messeguer, Ricardo Rozas
Bioinform.3
2003 Fringe analysis of synchronized parallel insertion algorithms in 2-3 Trees
Ricardo Baeza-Yates, Joaquim Gabarró, Xavier Messeguer
Theor. Comput. Sci.3
2002 PROMO: detection of known transcription regulatory elements using species-tailored searches
abstract
Abstract Summary: We have developed a set of tools to construct positional weight matrices from known transcription factor binding sites in a species or taxon-specific manner, and to search for matches in DNA sequences. Availability: PROMO can be accessed online at http://www.lsi.upc.es/~alggen under the research link. Supplementary information: An example of the graphic interface (Figure 1) can be visualized at http://www.lsi.upc.es/~alggen/recerca/promo/figuraBioinformatics.html. Contact: [email protected]; [email protected] * To whom correspondence should be addressed.
Xavier Messeguer, Ruth Escudero, Domènec Farré, Oscar Núñez, M. Mar Albà
Bioinform.1
1998 Relaxed Tree Structures, a Way to Deal with Concurrency and Parallelism on Dictionaries
Joaquim Gabarró, Xavier Messeguer
MCU (1)2
1998 Parallel Dictionaries with Local Rules on AVL and Brother Trees
Joaquim Gabarró, Xavier Messeguer
Inf. Process. Lett.2
1997 Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract)
Luc Bougé, Joaquim Gabarró, Xavier Messeguer, Nicolas Schabanel
Euro-Par3
1996 A Design of a Parallel Dictionary Using Skip Lists
Joaquim Gabarró, Conrado Martínez, Xavier Messeguer
Theor. Comput. Sci.3
1993 Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs
Paola Alimonti, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela, Xavier Messeguer
WG4
1991 Dynamic Behaviour in Updating Process Over BST of Size Two with Probabilistic Deletion Algorithms
Xavier Messeguer
Inf. Process. Lett.1