<｜begin▁of▁sentence｜>### Instruction:
As a laboratory technician working in a genetics research facility, you have been tasked with analyzing a directed graph that represents the genetic interactions between different proteins. The edge set of the graph is provided, and you need to calculate the shortest paths from gene 0 to genes 1 and 3. Once identified, you should print the paths as lists of gene IDs. This analysis will contribute to the understanding of protein interactions and their potential impact on genetic processes.
### Response:
import igraph as ig

# Create a directed graph
edges = [(0, 2), (2, 3), (3, 1), (1, 0)]
g = ig.Graph(edges=edges, directed=True)

# Define the source vertex and target vertices
source = 0
targets = [1, 3]

# Calculate shortest paths from the source to all target vertices
shortest_paths = g.get_shortest_paths(v=source, to=targets, mode='OUT', output='vpath')

# Print the shortest paths as lists of vertex IDs
for path in shortest_paths:
    print(path)
<|EOT|>
