( en | de | ru )

 

Disambiguation of "Evans, Patricia A."

Author of the publication

copydeleteadd this publication to your clipboard
Dynamic parallelization for RNA structure comparison.

, , and . IPDPS, page 1-8. IEEE, (2009)

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.

Patricia A MacManus

Ilselore Evans

Jonathan Evans

Richard Evans

Neil Evans

 

Other publications of authors with the same name

Exact Algorithms for Computing Pairwise Alignments and 3-Medians From Structure-Annotated Sequences (Extended Abstract)., and . Pacific Symposium on Biocomputing, page 559-570. (2001)A Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees., , and . J. Comput. Biol., 17 (10): 1451-1465 (2010)Finding Common RNA Pseudoknot Structures in Polynomial Time.. CPM, volume 4009 of Lecture Notes in Computer Science, page 223-232. Springer, (2006)Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries., , and . COCOA, volume 5165 of Lecture Notes in Computer Science, page 23-31. Springer, (2008)Finding Common RNA Secondary Structures: A Case Study on the Dynamic Parallelization of a Data-driven Recurrence., , and . IPDPS Workshops, page 715-724. IEEE Computer Society, (2012)Finding Common Subsequences with Arcs and Pseudoknots.. CPM, volume 1645 of Lecture Notes in Computer Science, page 270-280. Springer, (1999)Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites., and . ISBRA, volume 6053 of Lecture Notes in Computer Science, page 29-37. Springer, (2010)Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites., and . WABI, volume 6293 of Lecture Notes in Computer Science, page 124-135. Springer, (2010)Mapping Transcription Factors from a Model to a Non-model Organism., , and . IJCBS, page 160-166. IEEE Computer Society, (2009)Finite-State Computability of Annotations of Strings and Trees., , and . CPM, volume 1075 of Lecture Notes in Computer Science, page 384-391. Springer, (1996)