( en | de | ru )

 

Disambiguation of "Tomescu, Alexandru I."

Author of the publication

copydeleteadd this publication to your clipboard
On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy.

, , , , and . BIOINFORMATICS, page 272-277. SciTePress, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexandru Lupa

Alexandru Aleman

Alexandru Sarafiant

Alexandru Soceanu

Alexandru Plesco

 

Other publications of authors with the same name

Algorithms and Complexity on Indexing Elastic Founder Graphs., , , , , and . ISAAC, volume 212 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)MetaFlow: Metagenomic Profiling Based on Whole-Genome Coverage Analysis with Min-Cost Flows., , and . RECOMB, volume 9649 of Lecture Notes in Computer Science, page 111-121. Springer, (2016)On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy., , , , and . BIOINFORMATICS, page 272-277. SciTePress, (2016)SNV-PPILP: refined SNV calling for tumor data using perfect phylogenies and ILP., , and . Bioinform., 31 (7): 1133-1135 (2015)Safe and Complete Contig Assembly Via Omnitigs., and . RECOMB, volume 9649 of Lecture Notes in Computer Science, page 152-163. Springer, (2016)Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time., , , and . ICALP, volume 198 of LIPIcs, page 43:1-43:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Well-Quasi-Ordering Hereditarily Finite Sets., and . LATA, volume 6638 of Lecture Notes in Computer Science, page 440-451. Springer, (2011)Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time., , , , and . SODA, page 359-376. SIAM, (2022)Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG., , , , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 19 (6): 3673-3684 (2022)Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails., , and . SOFSEM, volume 12607 of Lecture Notes in Computer Science, page 608-622. Springer, (2021)