### 11 papers:

- ICML-2015-LeeY #category theory #predict #strict
- Boosted Categorical Restricted Boltzmann Machine for Computational Prediction of Splice Junctions (TL, SY), pp. 2483–2492.
- OOPSLA-2012-JoK #automation #locality #traversal
- Automatically enhancing locality for tree traversals with traversal splicing (YJ, MK), pp. 355–374.
- DLT-2011-BonizzoniJ #constant
- Regular Splicing Languages Must Have a Constant (PB, NJ), pp. 82–92.
- SIGIR-2011-TangLWWL #ambiguity #graph #network #social
- A bipartite graph based social network splicing method for person name disambiguation (JT, QL, TW, JW, WL), pp. 1233–1234.
- DLT-2007-LoosO #complexity
- Complexity Theory for Splicing Systems (RL, MO), pp. 300–311.
- DLT-2006-BonizzoniM #reflexive
- A Decision Procedure for Reflexive Regular Splicing Languages (PB, GM), pp. 315–326.
- GPCE-2004-McDirmidH #aspect-oriented #named #source code
- Splice: Aspects That Analyze Programs (SM, WCH), pp. 19–38.
- DLT-2003-BonizzoniFMZ #finite #reflexive #regular expression
- Regular Languages Generated by Reflexive Finite Splicing Systems (PB, CdF, GM, RZ), pp. 134–145.
- DLT-2002-BonizzoniFMZ #linear #problem
- Decision Problems for Linear and Circular Splicing Systems (PB, CdF, GM, RZ), pp. 78–92.
- ESOP-1999-Thiemann #higher-order
- Higher-Order Code Splicing (PT), pp. 243–257.
- ICALP-1989-CulikH
- Dominoes and the Regularity of DNS Splicing Languages (KCI, TH), pp. 222–233.