scispace - formally typeset
Search or ask a question
Institution

Turku Centre for Computer Science

FacilityTurku, Finland
About: Turku Centre for Computer Science is a facility organization based out in Turku, Finland. It is known for research contribution in the topics: Decidability & Word (group theory). The organization has 382 authors who have published 1027 publications receiving 19560 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: A prefiltering scheme for evaluating the quality of spectra before the database search to remove those spectra that are unlikely to provide a confident or valid peptide identification and in this way to reduce the labour from the validation phase.
Abstract: Motivation: Peptide identification by tandem mass spectrometry is an important tool in proteomic research. Powerful identification programs exist, such as SEQUEST, ProICAT and Mascot, which can relate experimental spectra to the theoretical ones derived from protein databases, thus removing much of the manual input needed in the identification process. However, the time-consuming validation of the peptide identifications is still the bottleneck of many proteomic studies. One way to further streamline this process is to remove those spectra that are unlikely to provide a confident or valid peptide identification, and in this way to reduce the labour from the validation phase. Results: We propose a prefiltering scheme for evaluating the quality of spectra before the database search. The spectra are classified into two classes: spectra which contain valuable information for peptide identification and spectra that are not derived from peptides or contain insufficient information for interpretation. The different spectral features developed for the classification are tested on a real-life material originating from human lymphoblast samples and on a standard mixture of 9 proteins, both labelled with the ICAT-reagent. The results show that the prefiltering scheme efficiently separates the two spectra classes. Availability: The software tools are available on request from the authors. Contact: jussi.salmi@it.utu.fi Supplementary information: The Mascot ion score distributions and the C4.5 classification rules can be found at address http://staff.cs.utu.fi/staff/jussi.salmi/Supplementary_material.pdf

49 citations

Journal ArticleDOI
TL;DR: Phosphoproteomes regulated by either RAS or PP2A, by phosphopeptide enrichment followed by mass-spectrometry-based label-free quantification revealed a significant overlap in their functional pathways.
Abstract: Hyperactivated RAS drives progression of many human malignancies. However, oncogenic activity of RAS is dependent on simultaneous inactivation of protein phosphatase 2A (PP2A) activity. Although PP2A is known to regulate some of the RAS effector pathways, it has not been systematically assessed how these proteins functionally interact. Here we have analyzed phosphoproteomes regulated by either RAS or PP2A, by phosphopeptide enrichment followed by mass-spectrometry-based label-free quantification. To allow data normalization in situations where depletion of RAS or PP2A inhibitor CIP2A causes a large uni-directional change in the phosphopeptide abundance, we developed a novel normalization strategy, named pairwise normalization. This normalization is based on adjusting phosphopeptide abundances measured before and after the enrichment. The superior performance of the pairwise normalization was verified by various independent methods. Additionally, we demonstrate how the selected normalization method influences the downstream analyses and interpretation of pathway activities. Consequently, bioinformatics analysis of RAS and CIP2A regulated phosphoproteomes revealed a significant overlap in their functional pathways. This is most likely biologically meaningful as we observed a synergistic survival effect between CIP2A and RAS expression as well as KRAS activating mutations in TCGA pan-cancer data set, and synergistic relationship between CIP2A and KRAS depletion in colony growth assays.

49 citations

Journal ArticleDOI
TL;DR: A freely available web application built on top of 21.3 million detailed biomolecular events extracted from all PubMed abstracts, generated by a state-of-the-art event extraction system and enriched with gene family associations and abstract generalizations, accounting for lexical variants and synonymy.
Abstract: Technological advancements in the field of genetics have led not only to an abundance of experimental data, but also caused an exponential increase of the number of published biomolecular studies. Text mining is widely accepted as a promising technique to help researchers in the life sciences deal with the amount of available literature. This paper presents a freely available web application built on top of 21.3 million detailed biomolecular events extracted from all PubMed abstracts. These text mining results were generated by a state-of-the-art event extraction system and enriched with gene family associations and abstract generalizations, accounting for lexical variants and synonymy. The EVEX resource locates relevant literature on phosphorylation, regulation targets, binding partners, and several other biomolecular events and assigns confidence values to these events. The search function accepts official gene/protein symbols as well as common names from all species. Finally, the web application is a powerful tool for generating homology-based hypotheses as well as novel, indirect associations between genes and proteins such as coregulators.

49 citations

Journal ArticleDOI
TL;DR: A decision method is given for the Positivity Problem for second order recurrent sequences: it is decidable whether or not a recurrent sequence defined by un = aun-1 + bun-2 has only nonnegative terms.

48 citations

Journal ArticleDOI
TL;DR: New lower bounds are established in the number of matrices for the mortality, zero in the left upper corner, vector reachability, matrix reachable, scalar reachability and freeness problems and a short proof for a strengthened result due to Bell and Potapov stating that the membership problem is undecidable.
Abstract: There are several known undecidable problems for 3 × 3 integer matrices the proof of which use a reduction from the Post Correspondence Problem (PCP). We establish new lower bounds in the number of matrices for the mortality, zero in the left upper corner, vector reachability, matrix reachability, scalar reachability and freeness problems. Also, we give a short proof for a strengthened result due to Bell and Potapov stating that the membership problem is undecidable for finitely generated matrix semigroups R ⊆ ℤ4×4 whether or not kI4 ∈ R for any given |k| > 1. These bounds are obtained by using the Claus instances of the PCP.

48 citations


Authors

Showing all 383 results

NameH-indexPapersCitations
José A. Teixeira101141447329
Cunsheng Ding6125411116
Jun'ichi Tsujii5938915985
Arto Salomaa5637417706
Tero Aittokallio522718689
Risto Lahdelma481496637
Hannu Tenhunen4581911661
Mats Gyllenberg442048029
Sampo Pyysalo421538839
Olli Polo421405303
Pasi Liljeberg403066959
Tapio Salakoski382317271
Filip Ginter371567294
Robert Fullér371525848
Juha Plosila353424917
Network Information
Related Institutions (5)
Vienna University of Technology
49.3K papers, 1.3M citations

84% related

Eindhoven University of Technology
52.9K papers, 1.5M citations

83% related

Aalto University
32.6K papers, 829.6K citations

83% related

Carnegie Mellon University
104.3K papers, 5.9M citations

82% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20231
20223
20213
20209
20198
201816