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

Cyriac Kandoth

dblp:18/7123 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2015
0000-0002-1345-3573ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 5 · 1 first-author

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
2 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › cancer genomics
gene fusion detection
0.112012
BreakFusion: targeted assembly-based identification of gene fusions in whole transcriptome paired-end sequencing data · Bioinform. 2012
Bioinformatics and computational biology › transcriptomics
transcriptome sequencing
0.112012
BreakFusion: targeted assembly-based identification of gene fusions in whole transcriptome paired-end sequencing data · Bioinform. 2012
Bioinformatics and computational biology
cancer genomics
0.112011
PathScan: a tool for discerning mutational significance in groups of putative cancer genes · Bioinform. 2011

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

reference alignment · 0.1read-pair analysis · 0.1de novo assembly · 0.1fisher-lancaster theory · 0.1convolution-based approximation · 0.1
YearPublicationVenuePosition
2015 Genome Modeling System: A Knowledge Management Platform for Genomics
abstract
In this work, we present the Genome Modeling System (GMS), an analysis information management system capable of executing automated genome analysis pipelines at a massive scale. The GMS framework provides detailed tracking of samples and data coupled with reliable and repeatable analysis pipelines. The GMS also serves as a platform for bioinformatics development, allowing a large team to collaborate on data analysis, or an individual researcher to leverage the work of others effectively within its data management system. Rather than separating ad-hoc analysis from rigorous, reproducible pipelines, the GMS promotes systematic integration between the two. As a demonstration of the GMS, we performed an integrated analysis of whole genome, exome and transcriptome sequencing data from a breast cancer cell line (HCC1395) and matched lymphoblastoid line (HCC1395BL). These data are available for users to test the software, complete tutorials and develop novel GMS pipeline configurations. The GMS is available at https://github.com/genome/gms.
Malachi Griffith, Obi L. Griffith, Scott M. Smith, Avinash Ramu, Matthew B. Callaway, Anthony M. Brummett, Michael J. Kiwala, Adam C. Coffman, Allison A. Regier, Benjamin J. Oberkfell, Gabriel E. Sanderson, Thomas P. Mooney, Nathaniel G. Nutter, Edward A. Belter, Feiyu Du, Robert L. Long, Travis E. Abbott, Ian T. Ferguson, David L. Morton, Mark M. Burnett, James V. Weible, Joshua B. Peck, Adam Dukes, Joshua F. McMichael, Justin T. Lolofie, Brian R. Derickson, Jasreet Hundal, Zachary L. Skidmore, Benjamin J. Ainscough, Nathan D. Dees, William S. Schierding, Cyriac Kandoth, Kyung H. Kim, Charles Lu 0002, Christopher C. Harris, Nicole Maher, Christopher A. Maher, Vincent J. Magrini, Benjamin S. Abbott, Ken Chen 0001, Eric Clark, Indraniel Das, Xian Fan, Amy E. Hawkins, Todd G. Hepler, Todd Wylie, Shawn M. Leonard, William E. Schroeder, Xiaoqi Shi, Lynn K. Carmichael, Matthew R. Weil, Richard W. Wohlstadter, Gary Stiehr, Michael D. McLellan, Craig S. Pohl, Christopher A. Miller 0002, Daniel C. Koboldt, Jason R. Walker, James M. Eldred, David E. Larson, David J. Dooling, Elaine R. Mardis, Richard K. Wilson
PLoS Comput. Biol.32
2012 BreakFusion: targeted assembly-based identification of gene fusions in whole transcriptome paired-end sequencing data
abstract
Abstract Summary: Despite recent progress, computational tools that identify gene fusions from next-generation whole transcriptome sequencing data are often limited in accuracy and scalability. Here, we present a software package, BreakFusion that combines the strength of reference alignment followed by read-pair analysis and de novo assembly to achieve a good balance in sensitivity, specificity and computational efficiency. Availability: http://bioinformatics.mdanderson.org/main/BreakFusion Contact: [email protected]; [email protected] Supplementary information: Supplementary data are available at Bioinformatics online
Ken Chen 0001, John W. Wallis, Cyriac Kandoth, Joelle M. Kalicki-Veizer, Karen L. Mungall, Andrew J. Mungall, Steven J. M. Jones, Marco A. Marra, Timothy J. Ley, Elaine R. Mardis, Richard K. Wilson, John N. Weinstein
Bioinform.3
2011 PathScan: a tool for discerning mutational significance in groups of putative cancer genes
abstract
MOTIVATION: The expansion of cancer genome sequencing continues to stimulate development of analytical tools for inferring relationships between somatic changes and tumor development. Pathway associations are especially consequential, but existing algorithms are demonstrably inadequate. METHODS: Here, we propose the PathScan significance test for the scenario where pathway mutations collectively contribute to tumor development. Its design addresses two aspects that established methods neglect. First, we account for variations in gene length and the consequent differences in their mutation probabilities under the standard null hypothesis of random mutation. The associated spike in computational effort is mitigated by accurate convolution-based approximation. Second, we combine individual probabilities into a multiple-sample value using Fisher-Lancaster theory, thereby improving differentiation between a few highly mutated genes and many genes having only a few mutations apiece. We investigate accuracy, computational effort and power, reporting acceptable performance for each. RESULTS: As an example calculation, we re-analyze KEGG-based lung adenocarcinoma pathway mutations from the Tumor Sequencing Project. Our test recapitulates the most significant pathways and finds that others for which the original test battery was inconclusive are not actually significant. It also identifies the focal adhesion pathway as being significantly mutated, a finding consistent with earlier studies. We also expand this analysis to other databases: Reactome, BioCarta, Pfam, PID and SMART, finding additional hits in ErbB and EPHA signaling pathways and regulation of telomerase. All have implications and plausible mechanistic roles in cancer. Finally, we discuss aspects of extending the method to integrate gene-specific background rates and other types of genetic anomalies. AVAILABILITY: PathScan is implemented in Perl and is available from the Genome Institute at: http://genome.wustl.edu/software/pathscan.
Michael C. Wendl, John W. Wallis, Ling Lin 0005, Cyriac Kandoth, Elaine R. Mardis, Richard K. Wilson
Bioinform.4
2010 A framework for automated enrichment of functionally significant inverted repeats in whole genomes
abstract
BACKGROUND: RNA transcripts from genomic sequences showing dyad symmetry typically adopt hairpin-like, cloverleaf, or similar structures that act as recognition sites for proteins. Such structures often are the precursors of non-coding RNA (ncRNA) sequences like microRNA (miRNA) and small-interfering RNA (siRNA) that have recently garnered more functional significance than in the past. Genomic DNA contains hundreds of thousands of such inverted repeats (IRs) with varying degrees of symmetry. But by collecting statistically significant information from a known set of ncRNA, we can sort these IRs into those that are likely to be functional. RESULTS: A novel method was developed to scan genomic DNA for partially symmetric inverted repeats and the resulting set was further refined to match miRNA precursors (pre-miRNA) with respect to their density of symmetry, statistical probability of the symmetry, length of stems in the predicted hairpin secondary structure, and the GC content of the stems. This method was applied on the Arabidopsis thaliana genome and validated against the set of 190 known Arabidopsis pre-miRNA in the miRBase database. A preliminary scan for IRs identified 186 of the known pre-miRNA but with 714700 pre-miRNA candidates. This large number of IRs was further refined to 483908 candidates with 183 pre-miRNA identified and further still to 165371 candidates with 171 pre-miRNA identified (i.e. with 90% of the known pre-miRNA retained). CONCLUSIONS: 165371 candidates for potentially functional miRNA is still too large a set to warrant wet lab analyses, such as northern blotting, on all of them. Hence additional filters are needed to further refine the number of candidates while still retaining most of the known miRNA. These include detection of promoters and terminators, homology analyses, location of candidate relative to coding regions, and better secondary structure prediction algorithms. The software developed is designed to easily accommodate such additional filters with a minimal experience in Perl.
Cyriac Kandoth, Fikret Erçal, Ronald L. Frank
BMC Bioinform.1
2008 Validation of an NSP-based (negative selection pattern) gene family identification strategy
abstract
BACKGROUND: Gene family identification from ESTs can be a valuable resource for analysis of genome evolution but presents unique challenges in organisms for which the entire genome is not yet sequenced. We have developed a novel gene family identification method based on negative selection patterns (NSP) between family members to screen EST-generated contigs. This strategy was tested on five known gene families in Arabidopsis to see if individual paralogs could be identified with accuracy from EST data alone when compared to the actual gene sequences in this fully sequenced genome. RESULTS: The NSP method uniquely identified family members in all the gene families tested. Two members of the FtsH gene family, three members each of the PAL, RF1, and ribosomal L6 gene families, and four members of the CAD gene family were correctly identified. Additionally all ESTs from the representative contigs when checked against MapViewer data successfully identify the gene locus predicted. CONCLUSION: We demonstrate the effectiveness of the NSP strategy in identifying specific gene family members in Arabidopsis using only EST data and we describe how this strategy can be used to identify many gene families in agronomically important crop species where they are as yet undiscovered.
Ronald L. Frank, Cyriac Kandoth, Fikret Erçal
BMC Bioinform.2